Signal separation method, signal separation device and recording medium

ABSTRACT

A method and a device for signal separation. First, values of signals observed by M sensors are transformed into frequency domain values, and these frequency domain values are used to calculate relative values of the observed values between the sensors at each frequency. These relative values are clustered into N clusters, and the representative value of each cluster is calculated. Then, using these representative values, a mask is produced to extract the values of the signals emitted by V (1≦V≦M) signal sources from the frequency-domain signal values, and this mask is applied to the frequency-domain signal values. After that, if V=1 then the limited signal is output directly as a separated signal, while if V≧2 then the separated values are obtained by separating this limited signal with separation techniques such as ICA.

TECHNICAL FIELD

The present invention relates to the field of signal processing, and in particular it relates to a signal separation method, a signal separation device and a signal separation program that can be used to estimate a source signal (target signal) in situations where the required target signal cannot be obtained by direct observation and the target signal is observed as a mixture with other signals, and to a recording medium that stores such a program.

BACKGROUND ART

Hitherto, blind source separation (BSS) has been known as a technique for separating and extracting the original source signals from a mixed signal consisting of a mixture of a plurality of source signals (e.g., audio signals), without using any prior knowledge about the source signals or the mixing process. FIG. 27A shows a block diagram that illustrates the concept of this blind source separation technique.

As this figure shows, a plurality of (in this case, N) signal sources 701 emit source signals s_(i) (i=1, . . . , N) which are mixed together and observed with a plurality of(in this case, M) sensors 702, and under these conditions the separated signals y_(k) (k=1, . . . , N) estimated to correspond to the source signals are extracted from these observed signals x_(j) (j=1, . . . , M). Here, the process that takes place between the source signals s_(i) emitted from signals sources 701 and the observations by sensors 702 is referred to as the “mixing process”, and the process whereby the separated signals are extracted from the observations of sensors 702 is called the “separation process”.

To start with, the observed signals and the separation problem are formularized as follows.

A Model of Mixed Signals (Observed Signals) in Real Environments

First, the mixing process is modeled as follows.

Here, N is the number of signal sources 701, M is the number of sensors 702, s_(i) is the signal (source signal) emitted from the i-th signal source 701 (signal source i), and h_(ji) is the impulse response from signal source i to the j-th sensor 702 (sensor j). The signal x_(j) observed at sensor j is modeled by the convolutive mixtures of these source signals s_(i) and impulse responses h_(ji) as follows:

$\begin{matrix} {{{FORMULA}\mspace{14mu} 1}{{x_{j}(t)} = {\sum\limits_{i = 1}^{N}\;{\sum\limits_{p = 1}^{P}\;{{h_{ji}(p)}{s_{i}\left( {t - p + 1} \right)}}}}}} & (1) \end{matrix}$ Here, the term “convolution” means that the signals are added together after being delayed and being multiplied by specific coefficients in the signal propagation process. It is assumed that all the signals are sampled at a certain sampling frequency and represented by discrete values. In Formula (1), P represents the length of the impulse response, t represents the sampling time, and p represents a sweep variable (“sweep” being an operation whereby different coefficients are applied to each sample value of a time-shifted signal). The N signal sources 701 are assumed to be statistically mutually independent, and each signal is assumed to be sufficiently sparse. Here, “sparse” means that the signal has a value of zero at most time t—sparsity is exhibited by speech signals, for example.

The aim of BSS is to obtain separated signals y_(k) from the observed signals x_(j) by estimating a separation system (W) 703 without any prior knowledge of the source signals s_(i) or impulse responses h_(ji).

Since convolutional mixing problems are complicated to address and the assumption of sparsity holds better in the time-frequency domain, an effective way of addressing the above problem involves first applying a short-time discrete Fourier transform (DFT) to the abovementioned Formula (1) to transform the signal into the time-frequency domain. In the time-frequency domain, the abovementioned Formula (1) becomes X(f,m)=H(f)S(f,m) where f is the frequency, and m represents the timing of the DFT frames. H(f) is an (M×N) matrix whose ji element is the frequency response H_(ji)(f) from signal source i to sensor j, and is referred to as the mixing matrix. Also, S(f,m)=[S₁(f,m), . . . , S_(N)(f,m)]^(T) and X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)] are the DFT results obtained for the source signals and observed signals, respectively. Here, the notation [α]T denotes the transposed matrix of α. Furthermore, S(f,m) and X(f,m) are vectors.

Hereafter, explanations are given in the time-frequency domain.

Model of the Separation Process

The separation process is modeled as follows.

First, let W(f,m) be an (N×M) matrix whose jk element is the frequency response W_(jk)(f,m) from the observed signal at sensor j to the separated signal y_(k). This matrix W(f,m) is called the separation matrix. Using the separation matrix, the separated signals can be obtained in the time-frequency domain as follows: Y(f,m)=W(f,m)X(f,m) Here, Y(f,m)=[Y₁(f,m), . . . , Y_(N)(f,m)]^(T) represents the separated signals in the time-frequency domain, and subjecting this to a short-time inverse discrete Fourier transform (IDFT) yields the separated signals y_(k)—i.e., the results of estimating the source signals. Note that the separated signals y_(k) are not necessarily ordered in the same way as the source signals s_(i). That is, it is not necessarily the case that k=i. Also, Y(f,m) is a vector.

Estimating the Separation Matrix W(F,M)

In BSS, the separation matrix W(f,m) is estimated by using solely the observed signals.

Known conventional methods for estimating the separated signals Y(f,m) include: (a) methods based on independent component analysis, (b) methods that utilize the sparsity of the signals, and (c) methods in which the mixing matrix is estimated based on the signal sparsity. These methods are discussed in turn below.

Conventional Method 1: Independent Component Analysis

Independent component analysis (ICA) is a technique in which signals that have been combined by linear mixing as in Formula (1) above are separated based on the statistical independence of the signals. FIG. 27B shows a block diagram of an ICA separation process for the case where N=M=2. In the time-frequency domain ICA, we perform successive learning with the learning rule W(f)=W(f)+ΔW(f) to find a separation matrix W(f,m) at each frequency so that each element of the output signal Y(f,m) becomes mutually independent. Here, the estimation unit 705 of the ICA separation matrix might determine ΔW(f) by the following rule, for example: ΔW=μ[I−<φ(Y(f,m))Y(f,m)^(H)>]  (2) Here, the notation [α]^(H) denotes the conjugate transpose of α. Also, I represents a unit matrix, < . . . > represents time averaging, φ represents a nonlinear function, and μ represents the update coefficient. Separation systems obtained by ICA are time-invariant linear systems. Various forms of the ICA algorithm have been introduced, including the one mentioned in Non-Patent Reference 1.

In ICA, since separation is performed by concentrating on the independence of the signals, the matrix Y′(f,m)=[Y₁′(f,m), . . . , Y_(N)′(f,m)]^(T) obtained from the relationship Y′(f,m)=W(f,m)X(f,m) using this separation matrix W(f,m) is indeterminate with respect to the ordering and scaling of the separated signals. This is because independence between the separated signals is preserved even when the ordering and scaling of the signals change.

The process of resolving this indeterminacy of ordering is referred to as permutation resolution, and results in a separated signal Y_(i)(f,m) where the separated signal components corresponding to the same source signal s_(i) have the same subscript i at all frequencies. Methods for achieving this include a method in which the estimated arrival directions of signals obtained using the inverse matrix of the separation matrix (the Moore-Penrose pseudo-inverse matrix for cases where N≠M) are verified, and the rows of the separation matrix W(f,m) are replaced so that the estimated arrival direction corresponding to the i-th separated signal becomes the same at each frequency, and a method in which the rows of the separation matrix W(f,m) are replaced so as to maximize the correlation between the absolute values |Y_(i)(f,m)| of the i-th separated signal between different frequencies. In this example, a permutation/scaling solving unit 706 resolves these permutations while feeding back the separated signals Y_(i)(f,m).

The process of resolving the indeterminacy of magnitude is referred to as scaling resolution. Permutation/scaling solving unit 706 performs this scaling resolution by, for example, calculating the inverse matrix (the Moore-Penrose pseudo-inverse matrix for cases where N≠M).W⁻¹(f,m) of the separation matrix W(f,m) obtained after permutation resolution, and then scaling each row w_(i)(f,m) of the separation matrix W(f,m) as follows: w _(i)(f,m)←[W ⁻¹(f,m)]_(ji) w _(i)(f,m)

The separated signals at each frequency can then be obtained from Y(f,m)=W(f,m)X(f,m) by using the separation matrix W(f,m) in which the indeterminacy of ordering and magnitude have been resolved.

With regard to the abovementioned learning rule, it is possible to use a function like φ(Y)=φ(|Y|)·exp(j·∠(Y)) φ(x)=sign(x) as the nonlinear function in Formula (2). Also, as mentioned above, it is possible to use any permutation resolution method such as the signal arrival direction estimation method or the method that utilizes the similarity in the frequency components of the separated signals, or a combination of such methods, details of which can be found in Patent Reference 1 and Non-Patent Reference 2. Furthermore, a requirement of ICA is that the number of signal sources N and the number of sensors M obey the relationship M≧N.

Conventional Method 2: The Sparsity Method

In cases where the number of signal sources N and the number of sensors M obey the relationship M<N, separation can be achieved by methods based on the signal sparsity (e.g., Non-Patent Reference 3).

By assuming the signals to be sparse and mutually independent, even when a plurality of signals are present at the same time, it can be assumed that in the sample levels there is a low probability of observing overlapping signals at the same timing. That is, it can be assumed that there is no more than one signal contained in the observed signal at any one time. Accordingly, the signals can be separated by using a separation system W(f,m) consisting of a function that uses some method to estimate which signal source emitted the signal observed at each timing and only extracts signals at this timing (binary mask). This is the sparsity method.

FIG. 28 (conventional method 2) shows a block diagram to illustrate this sparsity method.

The following method is generally used to estimate the signal source at each timing. If each signal source is assumed to be spatially separate, then between the signals observed by the plurality of sensors there will exist phase difference and amplitude ratios determined by the relative positions of the signal sources and sensors. From the assumption that there is at most one signal contained in the observed signal at each timing, the phase differences and amplitude ratios of the observed signal at this timing correspond to the phase difference and amplitude ratio of the one signal contained in the observed signal at this timing. Accordingly, the phase differences and amplitude ratios of the observed signal in each sample can be subjected to a clustering process, and we can estimate each source signal by reconstituting the signals belonging to each cluster.

This is described in more specific detail as follows. First, observed signal relative value calculation unit 751 calculates the phase differences and/or amplitude ratios between the observed signals X(f,m) to obtain relative values z(f,m) as follows:

FORMULA  2 ${{Phase}\mspace{14mu}{difference}\mspace{14mu}{z_{1}\left( {f,m} \right)}} = {\angle\frac{X_{i}\left( {f,m} \right)}{X_{j}\left( {f,m} \right)}\left( {i \neq j} \right)}$ ${{Amplitude}\mspace{14mu}{ratio}\mspace{14mu}{z_{2}\left( {f,m} \right)}} = {\frac{{{X_{i}\left( {f,m} \right)}}}{{X_{j}\left( {f,m} \right)}}{\left( {i \neq j} \right).}}$ Alternatively, instead of using the phase difference itself, it is also possible to use the signal arrival directions derived from the phase differences as relative values z(f,m).

Next, the distribution of the relative values z(f,m) is checked and clustered into N clusters by clustering unit 752. An example of such a distribution is shown in FIG. 29. In this example, a mixed signal comprising three signals (N=3) is observed by sensor 1 (j=1) and sensor 2 (j=2) FIG. 29A shows the distribution obtained using the phase difference alone, and FIG. 2B shows the distribution obtained using both the phase difference and the amplitude ratio. As this figure shows, sparsity allows these distributions to be classified into N=3 clusters 801-803 or 811-813.

Next, the representative values (peak, mean, median, etc.) of these N clusters are obtained in representative value calculation unit 753. In the following discussion, for the sake of convenience, these are numbered a₁, a₂, . . . , a_(N) in ascending order (in FIG. 29 they are numbered a₁, a₂ and a₃).

Next, in binary mask preparation unit 754, a binary mask M_(k)(f,m) is prepared as follows:

$\begin{matrix} {{{FORMULA}\mspace{14mu} 3}{M_{k}\left( {f,m} \right)} = \left\{ {\begin{matrix} 1 & {{a_{k} - ɛ} \leq {z\left( {f,m} \right)} \leq {a_{k} + ɛ}} \\ 0 & {otherwise} \end{matrix}\left( {{k = 1},\ldots\mspace{11mu},N} \right)} \right.} & (3) \end{matrix}$ Here, ε is a parameter that determines the width of the binary mask. Next, in signal extraction unit 755, the k-th separated signal is obtained by performing the calculation Y_(k)(f,m)=M_(k)(f,m)X_(j)(f,m), where j is an arbitrary sensor number.

That is, the method based on sparsity described in this example results on a nonlinear system with a time-varying separation matrix W(f,m): W _(jk)(f,m)=M _(k)(f,m) for j∈{1, . . . , M} W _(kl)(f,m)=0 for l≠j (l=1, . . . , M)

Conventional Method 3: Estimating the Mixing Matrix Based on Sparsity

In this method, as a signal separation technique for cases where the number of signal sources N and the number of sensors M obey the relationship M=N, the sparsity of the signals is used to estimate the mixing matrix H(f), and the inverse matrix thereof is used to separate the signals (see, e.g., Non-Patent Reference 4 and Non-Patent Reference 5).

FIG. 28 (conventional method 3) shows a block diagram illustrating this method for estimating the mixing matrix based on sparsity.

The mixed signal X(f,m) is expressed in terms of the mixing matrix H(f) as follows:

$\begin{matrix} {{{FORMULA}\mspace{14mu}{4\begin{bmatrix} {X_{1}\left( {f,m} \right)} \\ {X_{2}\left( {f,m} \right)} \\ \vdots \\ {X_{N}\left( {f,m} \right)} \end{bmatrix}}} = {\begin{bmatrix} {H_{11}(f)} & \ldots & {H_{1N}(f)} \\ {H_{21}(f)} & \ldots & {H_{2N}(f)} \\ \vdots & ⋰ & \vdots \\ {H_{N1}(f)} & \ldots & {H_{NN}(f)} \end{bmatrix}\begin{bmatrix} {S_{1}\left( {f,m} \right)} \\ {S_{2}\left( {f,m} \right)} \\ \vdots \\ {S_{N}\left( {f,m} \right)} \end{bmatrix}}} & (4) \\ {\mspace{130mu}{= \;{\quad{\begin{bmatrix} 1 & \ldots & 1 \\ {{H_{21}(f)}/{H_{11}(f)}} & \ldots & {{H_{2N}(f)}/{H_{1N}(f)}} \\ \vdots & ⋰ & \vdots \\ {{H_{N1}(f)}/{H_{11}(f)}} & \ldots & {{H_{NN}(f)}/{H_{1N}(f)}} \end{bmatrix}{\quad\begin{bmatrix} {{H_{11}(f)}{S_{1}\left( {f,m} \right)}} \\ {{H_{12}(f)}{S_{2}\left( {f,m} \right)}} \\ \vdots \\ {{H_{1N}(f)}{S_{N}\left( {f,m} \right)}} \end{bmatrix}}}}}} & (5) \\ {\mspace{130mu}{\equiv {{\hat{H}(f)}{\hat{S}\left( {f,m} \right)}}}} & (6) \end{matrix}$ Thus, if Ĥ(f) can be estimated, then the separated signals Y(f,m) can be estimated from Y(f,m)=Ŝ(f,m)=Ĥ(f)⁻¹ X(f,m)  (7) This procedure for obtaining the separated signals Y(f,m) from the estimated Ĥ(f) is described below. In the following, the notation α^ is equivalent to the notation {circumflex over (α)}.

First, signals at timings where only one signal is present are 10 obtained by applying the same procedure as in [Conventional method 2] in observed signal relative value calculation unit 751, clustering unit 752, representative value calculation unit 753, binary mask preparation unit 754 and signal extraction unit 755: {circumflex over (X)}(f,m)=M _(k)(f,m)X(f,m)  Formula 5 Here, binary masks M_(k)(f,m) are applied to the observed signals X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)]^(T) of all the sensors. At this time, the timing m_(i) at which only source signal S_(i)(f,m) is active, for example, can be expressed as follows: Formula 6 {circumflex over (X)} _(j)(f,m _(i))=M _(i)(f,m _(j))X_(j)(f,m _(i))≈H _(ji)(f)S _(i)(f,m _(i))  (8)

The separated signals X^_(j)(f,m_(i)) obtained in this way are sent to mixing process calculation unit 756, where H^(f) is estimated by performing the following calculation:

$\quad\begin{matrix} {{{\hat{H}}_{ji}(f)} = {{E\left\lbrack \frac{{M_{k}\left( {f,m_{i}} \right)}{X_{j}\left( {f,m_{i}} \right)}}{{M_{k}\left( {f,m_{i}} \right)}{X_{1}\left( {f,m_{i}} \right)}} \right\rbrack}\mspace{70mu} = {{E\left\lbrack \frac{{\hat{X}}_{j}\left( {f,m_{i}} \right)}{\hat{X_{1}}\left( {f,m_{i}} \right)} \right\rbrack} = {{E\left\lbrack \frac{{H_{ji}(f)}{S_{i}\left( {f,m_{i}} \right)}}{{H_{1i}(f)}{S_{i}\left( {f,m_{i}} \right)}} \right\rbrack} = {E\left\lbrack \frac{H_{ji}(f)}{H_{1i}(f)} \right\rbrack}}}}} & (9) \end{matrix}$ where E[ . . . ] denotes averaging over m_(i). The matrix H^(f) obtained in this way is sent to inverse matrix calculation unit 757, where its inverse matrix H^(f)⁻¹ is obtained. Then, in signal separation unit 758, the calculation shown in Formula (7) above provides estimate the separated signals Y(f,m).

Note that since this procedure uses the inverse matrix of H^(f), it can only be applied in cases where the number of signal sources N and the number of sensors M obey the relationship M=N.

-   [Patent Reference 1] Japanese Unexamined Patent Publication No.     2004-145172 -   [Non-Patent Reference 1] A. Hyvaerinen, J. Karhunen and E. Oja,     “Independent Component Analysis,” John Wiley & Sons, 2001, ISBN     0-471-40540 -   [Non-Patent Reference 2] H. Sawada, R. Mukai, S. Araki and S.     Makino, “A Robust and Precise Method for Solving the Permutation     Problem of Frequency-Domain Blind Source Separation,”, in Proc. the     4th International Symposium on Independent Component Analysis and     Blind Signal Separation (ICA 2003), 2003, pp. 505-510 -   [Non-Patent Reference 3] S. Rickard, R. Balan, and J. Rosca,     “Real-Time Time-Frequency Based Blind Source Separation,” 3rd     International Conference on Independent Component Analysis and Blind     Source Separation (ICA2001), San Diego, December, 2001, pp. 651-656 -   [Non-Patent Reference 4] F. Abrard, Y. Deville, P. White, “From     blind source separation to blind source cancellation in the     underdetermined case: a new approach based on time-frequency     analysis,” Proceedings of the 3rd International Conference on     Independent Component Analysis and Signal Separation (ICA2001), pp.     734-739, San Diego, Calif., December 2001 -   [Non-Patent Reference 5] Y. Deville, “Temporal and time-frequency     correlation-based blind source separation methods,” in Proc.,     ICASSP2003, April 2003, pp. 1059-1064

DISCLOSURE OF THE INVENTION

Problem Addressed by the Invention

In conventional signal separation methods, when the number of signal sources N and the number of sensors M obey the relationship N>M, it has been difficult to achieve high-quality separation of the mixed signals.

Specifically, as mentioned above, when the number of signal sources N and the number of sensors M obey the relationship N>M, it is not possible to use methods based on independent component analysis or methods in which the mixing matrix is estimated based on sparsity.

Also, although it is possible to use methods that exploit the sparsity of signals, with these methods it is difficult to achieve signal separation with good separation performance and low distortion. Specifically, when creating a binary mask as shown in Formula (3) above, it is possible to achieve good separation performance if ε is made small enough, but on the other hand this increases the number of samples eliminated by this binary mask and degrades the separated signal. In other words, when the signals are completely sparse so that the observed signal contains at most one signal at each timing, then the relative values z(f,m) at each timing should converge around the vicinity of one of the representative values a₁, . . . , a_(N). However, since real signals are not completely sparse, there will also be cases where two or more observed signals are present at the same timing and frequency. In such cases, the relative values z(f,m) at this timing will be receded from the representative values a₁, . . . , a_(N) that would otherwise be expected, thus yielding a value of ε that causes the signals to be excluded by binary masking. As a result, the observed signal corresponding to this sample is treated as being zero, and a zero component is padded into the separated signal. Since the proportion of samples excluded in this way increases as the value of ε gets smaller, the amount of samples padded with a zero component also increases as ε gets smaller. When there are many zero components padded into each separated signal, this causes the distortion of the separated signals to increase, resulting in the generation of a perceptually uncomfortable type of noise called “musical noise”. On the other hand, if the value of ε used for binary masking is made large, then fewer zero components are padded into the separated signals and the occurrence of musical noise decreases, but instead the separation performance deteriorates.

The present invention has been made in the light of such problems, and aims to provide a technique that can perform high-quality separation of mixed signals even in cases where the relationship between the number of signal sources N and the number of sensors M is such that N>M.

Means of Solving the Problem

In the first present invention, the abovementioned problem is solved as follows:

First, the values of the observed signal—which is a mixture of N (N≧2) signals observed by M sensors—are transformed into frequency domain values, and these frequency domain values are used to calculate the relative values of the observed values between the sensors (including the mapping of relative values) at each frequency. These relative values are clustered into N clusters, and the representative value of each cluster is calculated. Then, using these representative values, a mask is produced to extract the values of the signals emitted by V (V≦M) signal sources from the frequency domain values, and this mask is used to extract the values of a limited signal comprising the signals emitted from these V signal sources. When V≧2, this limited signal is a mixed signal comprising the signals emitted by V signal sources, so this limited signal is further separated to yield each of the separated signal values. On the other hand, when V=1, the values of this limited signal are regarded as the separated signal values.

To separate limited signals consisting of signals emitted from V signal sources extracted in this way in which less samples are zero padded, it is possible to employ methods such as an independent component analysis method or a method in which the mixing matrix is estimated based on sparsity, for example. Consequently, it is possible to extract source signals with high quality even in cases where N>M. However, with this approach alone it is only possible to extract V source signals. Therefore, all the source signals are extracted by, for example, repeating the same processing while using a plurality of different types of mask to change the combinations of extracted signals.

In the second present invention, the abovementioned problem is solved as follows:

First of all, the observed signal values x₁(t), . . . , x_(M)(t) are transformed into frequency domain values X₁(f,m), . . . , X_(M)(f,m). First vectors X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)] consisting of the frequency domain values X₁(f,m), . . . , X_(M)(f,m) are then clustered into N clusters C_(i)(f) (i=1, . . . , N) for each frequency f, a second vector a_(i)(f) representative of each cluster C_(i)(F) is extracted, and V (V≦M) third vectors a_(p)(f) (p=1, . . . , V) are extracted therefrom. A mask M(f,m) is then produced according to the following formula, where G_(k) is the set of third vectors a_(p)(f), G_(k) ^(c) is the complementary set of G_(k), and the notation D(α,β) represents the Mahanalobis square distance of vectors α and β:

FORMULA   7 ${M\left( {f,m} \right)} = \left\{ \begin{matrix} 1 & {{\max_{{a_{p}{(f)}}{\varepsilon G}_{k}}{D\left( {{X\left( {f,m} \right)},{a_{p}(f)}} \right)}}{< {\min_{{a_{q}{(f)}}{\varepsilon G}_{k}^{c}}{D\left( {{X\left( {f,m} \right)},{a_{q}(f)}} \right)}}}} \\ 0 & {\;{otherwise}} \end{matrix} \right.$ and the products of mask M(f,m) with the first vectors X(f,m) are calculated to extract the values of the limited signal consisting of the signals emitted from V signal sources.

To separate limited signals consisting of signals emitted from V signal sources extracted in this way in which less samples are zero-padded, it is possible to employ a method such as independent component analysis or a method in which the mixing matrix is estimated based on sparsity, for example. Consequently, it is possible to extract source signals with high quality even in cases where N>M. However, with this approach alone it is only possible to extract V source signals. Therefore, for example, the same processing is repeated while using a plurality of different types of mask on a plurality of different types of set G_(k) to change the combinations of extracted signals. In this way, all the source signals are extracted. Therefore, for example, the same processing is repeated while using a plurality of different types of mask on a plurality of different types of set G_(k) to change the combinations of extracted signals. In this way, all the source signals are extracted.

In the third present invention, the abovementioned problem is solved as follows:

First, the observed signal values x₁(t), . . . , x_(M)(t) are transformed into frequency domain values X₁(f,m), . . . , X_(M)(f,m), and first vectors X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)]^(T) consisting of these values are clustered into N clusters C_(i)(f) (i=1, . . . , N) for each frequency f. If the source signals are sparse, then even in situations where there is an insufficient number of sensors (N>M), it is still possible to cluster these vectors into N clusters and to calculate representative vectors a_(i)(f) for each of these N clusters.

Second vectors a_(i)(f) are then calculated to represent each of these clusters C_(i)(f), and an N-row×M-column separation matrix W(f,m) is calculated as the Moore-Penrose pseudo-inverse matrix of an M-row×N-column matrix A′ in which 0 or more of the N said second vectors a_(i)(f) are substituted with zero vectors (this matrix is denoted by A′⁺(f), and is identical to the inverse matrix A′⁻¹ when N=M). The separation matrix W(f,m) generated here is a matrix that depends on time m in cases where the number of sensors in insufficient (N>M), and is independent of time m in cases where the number of sensors is sufficient (N≦M).

After that, the calculation Y(f,m)=W(f,m)X(f,m) is performed to calculate a separated signal vector Y(f,m)=[Y₁(f,m), . . . , Y_(N)(f,m)]^(T), which is performed to transformed into time-domain signal values y₁(t), . . . , y_(N)(t).

Here, due to the sparsity of the source signals, even if the number of signal sources N is greater than the number of sensors M (N>M), it is still highly probable that there are no more than M signal sources having values that affect the observation result in any given discrete time interval m. Consequently, for each discrete time interval m, the separation matrix W(f,m) generated as described above is able to separate these M or fewer signals. Then, in cases where N>M, since the separation matrix W(f,m) is time-dependent, the resulting combinations of separated signals are liable to differ between different discrete time intervals. Consequently, by obtaining separated signals for a plurality of discrete time intervals m, it is possible to obtain all the separated signals.

Advantages of the Invention

As described above, with the present invention it is possible to perform high-quality separation of mixed signals even when the relationship between the number of signal sources N and the number of sensors M is such that N>M.

BRIEF DESCRIPTION OF THE FIGURES

[FIG. 1] A block diagram showing an example of the overall configuration of a signal separation device according to a first embodiment.

[FIG. 2] A block diagram showing examples of the detailed configuration of the representative value generation unit, mask control unit, limited signal generation unit and limited signal separation unit in FIG. 1.

[FIG. 3] A block diagram showing an example of the detailed configuration of the mask generation unit in FIG. 1 and FIG. 2.

[FIG. 4] A flowchart illustrating the processing performed by a signal separation device according to the first embodiment.

[FIG. 5] An example of a histogram produced by the clustering unit.

[FIG. 6] A figure illustrating the method used to define the estimated arrival direction θ_(i) of signals used when generating a mask with a smooth profile in the first embodiment.

[FIG. 7] An example of a mask in the first embodiment.

[FIG. 8] A block diagram showing an example of one system of a signal separation device according to a second embodiment.

[FIG. 9] A block diagram showing an example of a single system of a signal separation device according to a third embodiment.

[FIG. 10] An example of a mask in the third embodiment.

[FIG. 11] A block diagram showing an example of the configuration of a mask generation unit according to a fourth embodiment.

[FIG. 12] An example of a binary mask in a sixth embodiment (A), and an example of a binary mask in a seventh embodiment (B).

[FIG. 13] A block diagram showing examples of the configuration of the representative value generation unit, mask control unit and limited signal generation unit according to an eighth embodiment.

[FIG. 14] A flowchart illustrating the signal separation process in the eighth embodiment.

[FIG. 15] A block diagram showing an example of the configuration of a signal separation device according to a ninth embodiment.

[FIG. 16] A flowchart illustrating the processing performed by a signal separation device according to the ninth embodiment.

[FIG. 17] A flowchart illustrating the separation matrix generation process performed when there is an insufficient number of sensors (M<N).

[FIG. 18] A plot of the observed signal vectors X(f,m) from a single audio source before normalization.

[FIG. 19] A plot of the observed signal vectors X(f,m) from a single audio source normalized by Formula (36).

[FIG. 20] A plot of the observed signal vectors X(f,m) from a single audio source normalized by Formula (37).

[FIG. 21] A plot of the observed signal vectors X(f,m) from two audio sources before normalization.

[FIG. 22] A plot of the observed signal vectors X(f,m) from two audio sources normalized by Formula (36).

[FIG. 23] A plot of the observed signal vectors X(f,m) from two audio sources normalized by Formula (37).

[FIG. 24] A flowchart illustrating a separation matrix generation process that can be applied regardless of whether or not there is a sufficient number of sensors with respect to the number of signal sources.

[FIG. 25] A partial block diagram showing an example of the configuration employed for transformation into the time domain after performing signal combination in the frequency domain.

[FIG. 26] An example of a signal separation device wherein each embodiment is configured by a computer.

[FIG. 27] A block diagram showing a conceptual example of a conventional blind source separation technique (A), and a block diagram of an ICA separation process (B).

[FIG. 28] A block diagram illustrating a method based on sparsity and a method for estimating a mixing matrix based on sparsity.

[FIG. 29] An example of the distribution of relative values.

LIST OF REFERENCE NUMERALS

1, 500: Signal separation device

2, 501: Memory unit

3, 502: Signal separation processor

BEST MODES FOR IMPLEMENTING THE INVENTION

Embodiments of the present invention are described below with reference to the figures.

First Embodiment

This embodiment is an embodiment relating to the first present invention; in this example, the values of a mixed signal comprising the signals emitted from V (2≦V≦M) sources (referred to as a “limited signal” in this embodiment) are extracted from the observed signal values by using a mask with a smooth profile that uses the directional characteristics of a null beam former, and ICA is used to perform signal separation on the extracted limited signal values.

FIG. 1 shows a block diagram of an example of the overall configuration of a signal separation device 1 according to this embodiment. FIG. 2 shows block diagrams of examples of the detailed configuration of representative value generation unit 30, mask control unit 40, limited signal generation unit 50-k (k=1, . . . , u; where u is the number of systems as described below), and limited signal separation unit 60-k. FIG. 3 shows a block diagram of an example of the detailed configuration of mask generation unit 51-k in FIG. 1 and FIG. 2. The arrows in these figures indicate the flow of data, but the flow of data into and out from control unit 10 and temporary memory unit 90 is not shown. Specifically, even when data passes through control unit 10 or temporary memory unit 90, the associated process is not shown. FIG. 4 shows a flowchart illustrating the processing performed by signal separation device 1 in this embodiment. In the following, these figures are used to describe the configuration of signal separation device 1 in this example, and the processing performed by this device.

Overall Configuration

First, the overall configuration of the signal separation device of this embodiment is described.

As FIG. 1 shows, the signal separation device 1 of this embodiment includes a memory unit 2 and a signal separation processor 3 that is electrically connected thereto by a hard-wired or wireless connection.

Memory unit 2 might be, for example, a hard disk device, a magnetic recording device such as a flexible disk or magnetic tape device, an optical disk device such as a DVD-RAM (random access memory) or CD-R (recordable)/RW (rewritable) device, a magneto-optical recording device such as an MO (magneto-optical) disc device, or a semiconductor memory such as an EEP-ROM (electronically erasable programmable read-only memory) or flash memory. Memory unit 2 may be situated inside the same enclosure as signal separation processor 3, or it may be housed separately.

This signal separation processor 3 consists of hardware configured from elements such as a processor and RAM, for example, and incorporates the processing blocks described below.

Summary of the Signal Separation Process

Next, the signal separation processing performed by signal separation device 1 is summarized.

In this embodiment, it is assumed that the signals emitted from the N signal sources are statistically independent of each other, and that each signal is sufficiently sparse. Here, “sparse” refers to the property of a signal that is zero or close to zero at almost all times t, and rarely takes a large value. This sort of sparsity is found to occur in speech signals, for example. Note that when speech signals and other signals that do not consist of white noise are converted into time-series data at different frequencies by performing a transformation such as a short time discrete Fourier transform, the proportion of timings at which the signals are close to zero becomes even larger, thereby accentuating their sparsity. Also, although Gaussian distributions are generally used to model signals, sparse signals are modeled not with Gaussian distributions but with other forms of distribution such as a Laplace distribution.

First, the M observed signal values x_(j)(t) are converted into frequency domain observed signal values X_(j)(f,m) by a frequency domain transformation unit 20, and then a representative value generation unit 30 calculates N representative values a₁, a₂, . . . , a_(N) corresponding to each source signal.

Next, V (2≦V≦M) of the representative values a₁, a₂, . . . , a_(N) are suitably selected by mask control unit 40, and in limited signal generation unit 50-k, the values X^(f,m) of a limited signal consisting only of V source signals are estimated from the observer signal values X_(j)(f,m). Note that when V=1, the method described under [Third embodiment] below is used. Here, a mask with a smooth profile is produced in mask generation unit 51-k to extract V signals, and in limited signal extraction unit 52-k this mask is applied to the observed signal values X_(j)(f,m) to estimate the limited signal values X^(f,m).

Next, in limited signal separation unit 60-k, a separation system is estimated for obtaining V separated signals. Here, M limited signal values X^(f,m) are provided as inputs, and V separated signal values Y(f,m) are obtained as outputs. With regard to the number of inputs M and outputs V in the separation system, since V≦M it is possible to use [Conventional method 1] or [Conventional method 3] to perform the estimation in this separation system.

Finally, in time domain transformation unit 70-k, the separated signal values Y(f,m) obtained in the time-frequency domain are transformed into time-domain signal values.

However, with the above processing alone, it is only possible to obtain V separated signals. Therefore, to obtain the other separated signals, the configuration of the V representative values selected in mask control unit 40 is changed, and the processing from limited signal generation unit 50-k to time domain transformation unit 70-k is performed in multiple systems (u systems).

Finally, the outputs from each system are combined in signal combination unit 80 to yield all N separated signals.

Detailed Configuration and Processing

Next, the configuration and processing of this example are described in detail.

This example relates to a device that separates and extracts source signals from observed signals in situations where the signals emitted from N (N≧2) signal sources are mixed together and observed by M sensors. Note that, as mentioned above, the signals in this example are signals that can be assumed to be sparse, such as speech signals, and the number of audio sources N is either known or can be estimated. Also, in this example it is assumed that the sensors are microphones or the like that are capable of observing these signals and are arranged on a straight line.

First, as a preliminary process, the time-domain observed signals x_(j)(t) (j=1, . . . , M) observed by each sensor are stored in memory unit 2. Then, when the signal separation process is started, signal separation processor 3 performs the following processing under the control of control unit 10.

First, signal separation processor 3 accesses memory unit 2, from where it sequentially reads in the observed signal values x_(j)(t), which it sends to frequency domain transformation unit 20 (Step S1). Frequency domain transformation unit 20 uses a transformation such as a short time discrete Fourier transform to transform these signal values into a series of frequency-domain observed signal values X_(j)(f,m) for each time interval, which it stores in temporary memory unit 90 (Step S2). The frequency-domain observed signal values X_(j)(f,m) stored in temporary memory unit 90 are sent to a representative value generation unit 30, and the relative value calculation unit 31 of representative value generation unit 30 uses these frequency-domain observed signal values X_(j)(f,m) to calculate the relative values z(f,m) of the observed values between each sensor at each frequency (Step S3).

The relative values z(f,m) may be obtained by using one or more parameters such as the phase difference or amplitude ratio, which are expressed as follows:

FORMULA  8 ${{Phase}\mspace{14mu}{difference}\mspace{14mu}{z_{1}\left( {f,m} \right)}} = {\angle\frac{X_{i}\left( {f,m} \right)}{X_{j}\left( {f,m} \right)}\left( {i \neq j} \right)}$ ${{Amplitude}\mspace{14mu}{ratio}\mspace{14mu}{z_{2}\left( {f,m} \right)}} = {\frac{{{X_{i}\left( {f,m} \right)}}}{{X_{j}\left( {f,m} \right)}}\left( {i \neq j} \right)}$ Alternatively, instead of using the phase difference itself, it is also possible to use a mapping thereof (e.g., the signal arrival directions derived from the phase differences).

In this example, these relative values z(f,m) are based on the arrival directions of the signals obtained from the phase differences z₁(f,m) between the observed signals from any two sensors (sensors j1 and j2) as follows:

FORMULA  9 ${z_{3}\left( {f,m} \right)} = {\cos^{- 1}\frac{{z_{1}\left( {f,m} \right)}v_{e}}{2\pi\;{fd}}}$ and these values of z₃(f,m) are calculated by relative value calculation unit 31. Here, v is the velocity of the signal, and d is the spacing between sensor j1 and sensor j2.

The relative values z₃(f,m) calculated in this way are stored in temporary memory unit 90. Next, clustering unit 32 sequentially reads out the relative values z₃(f,m) from temporary memory unit 90, and clusters these relative values z₃(f,m) into N clusters (Step S4). In this example, clustering unit 32 produces a histogram of the relative values z₃(f,m) sent to it.

FIG. 5 shows an example of a histogram produced in this way. Note that this example corresponds to a situation where the number of source signals is N=3.

As illustrated in this figure, this histogram consists of a distribution with N (=3) peaks. In this example, clustering unit 32 clusters this distribution into N (=3) clusters (clusters 91-93 in this example). This could, for example, be performed by clustering based on a suitable threshold value, or by using methods described in many textbooks such as the k-means method or hierarchical clustering—see, e.g., Richard O. Duda, “Pattern Classification (2^(nd) ed.)”, John Wiley & Sons, Inc., ISBN 0-471-05669-3, chapter 10. Here, each of the resulting clusters C_(i) (i=1, 2, . . . , N) is a set of relative values z₃(f,m), and can be expressed as C_(i)(f)={z₃(f,m)|mεT_(i)} using the set Ti of discrete time intervals.

The clustering information (clusters C₁, C₂, . . . , C_(N)) generated by clustering unit 32 are stored in temporary memory unit 90. Representative value calculation unit 33 reads in this information and calculates the representative values a₁, a₂, . . . , a_(N) of each of these N clusters C₁, C₂, . . . , C_(N) (Step S5). Specifically, it might obtain the representative values from the peak of each cluster in the histogram, or it might obtain the representative values from the mean of each cluster. For the sake of convenience, it is assumed that these N representative values are then, for example, arranged in ascending order a₁, a₂, . . . , a_(N) (see FIG. 5). Note that these representative values a₁, a₂, . . . , a_(N) are the estimated values of the arrival directions of each of the N signals.

In this example, the information on representative values a₁, a₂, . . . , a_(N) is sent to mask control unit 40 after being stored in temporary memory unit 90. In mask control unit 40, the data specifying a set G₀ whose elements are these representative values a₁, a₂, . . . , a_(N) is substituted into a variable SG₀, and this variable SG₀ is stored in temporary memory unit 90. Mask control unit 40 also initializes a variable SG specifying a set G to G=Ø (the empty set), and a variable k is set to zero; these are stored in temporary memory unit 90 (Step S6).

Next, under the control of mask control unit 40, processing is performed in a plurality of systems (u systems) in limited signal generation unit 50-k (k=1, . . . , u), limited signal separation unit 60-k and time domain transformation unit 70-k until all N separated signals have been obtained.

First, mask control unit 40 adds 1 to the value of variable k stored in temporary memory unit 90 to obtain a new value for variable k which is stored back in temporary memory unit 90 (Step S7). Next, mask control unit 40 retrieves the variables SG₀ and SG from temporary memory unit 90. Then, in mask control unit 40, a set G_(k) is selected consisting of V (≦M) suitable representative values including the members of the complementary set G_(c) of the set G specified by SG (the notation α^(c) represents the complementary set of α), the data specifying this set G_(k) is assigned to variable SG_(k), and this variable SG_(k) is stored in temporary memory unit 90 (Step S8).

The mask generation unit 51-k of limited signal generation unit 50-k reads out the variable SG_(k) stored in temporary memory unit 90, and produces a “smooth-profile mask” that extracts signals in the clusters whose representative values are in the set G_(k) specified by this variable SG_(k) (Step S9). Here, a “smooth-profile mask” means a function that takes high level values with respect to relative values in a prescribed range including V (2≦V≦M) representative values, and takes low level values with respect to representative values that are not inside this limited range, and where the transitions from the high level to the low level that accompany changes of the relative value occur in a continuous fashion. Note that in this example a “high level value” means a numerical value that is sufficiently greater then zero (e.g., 1 or more), and a “low level value” means a value that is sufficiently close to zero (e.g., at least 60 dB lower than the high level value), although no particular restrictions are placed on these values.

In this embodiment, a “smooth profile mask” is produced using the directional characteristics of a null beamformer formed by N−V+1 sensors. This mask is a mask with a smooth profile that is sufficiently sensitive in the direction (G_(k)) of the V signals included in the limited signal, and has a low sensitivity characteristic (a null) in the direction (G₀∩G_(k) ^(c)) of the N−V signals to be eliminated.

The procedure for creating the “smooth profile mask” of this embodiment is described below.

First, mask generation unit 51-k reads out the variables SG_(k), SG₀ and SG_(k) ^(c) from temporary memory unit 90. Mask generation unit 51-k then extracts any one of the elements (a representative value within the limited range) of set G_(k) representing variable SG_(k); this element is referred to as θ₁. Mask generation unit 51-k also extracts all the elements G₀∩G_(k) ^(c) (the representative values not inside the limited range) determined by variables SG₀ and SG_(k) ^(c), and these elements are referred to as θ_(i) (i=2, . . . , N−V+1). Mask generation unit 51-k then stores θ₁ and θ_(i)in temporary memory unit 90. Next, mask generation unit 51-k extracts θ₁ and θ_(i) from temporary memory 90, and calculates τ_(ji)=(d_(j)/v_(e))cos θ_(i) (j=1, . . . , N−V+1). Mask generation unit 51-k also calculates the elements ji of a delay matrix H_(NBF)(f) from the formula H_(NBFji)(f)=exp(j2πfτ_(ji)) and stores them in temporary memory unit 90. In these formulae, d_(j) is the distance between sensor 1 and sensor j (d₁=0), f is a frequency variable, and V_(e) is the signal velocity. These parameters could, for example, be pre-stored in temporary memory unit 90 and sequentially read out for use. The above process results in the generation of an ((N−V+1)×(N−V+1)) delay matrix H_(NBF)(f) (FIG. 3: 51 a-k).

In this embodiment, since the relative values are taken to be the arrival directions z₃(f,m) of the signals obtained from the phase difference z₁(f,m) between the signals observed by two sensors, the abovementioned θ₁ represents the arrival direction of a signal corresponding to a representative value inside the limited range, and θ_(i) represents the arrival direction of a signal corresponding to a representative value outside the limited range. These values of θ_(i) (i=1, 2, . . . , N−V+1) are defined as shown in FIG. 6. First, an origin is set in the middle of M sensors arranged on a straight line (where L₁ is the distance from the first sensor to the origin, and L₂ is the distance from the origin to the M-th sensor and L₁=L₂). The angle subtended between the line connecting this origin to the i-th signal source and the line connecting the origin to the first sensor is the angle θ_(i) corresponding to the i-th signal source. source.

The resulting delay matrix H_(NBF)(f) is sent from temporary memory unit 90 (FIG. 1) to NBF generation unit 51 b-k (FIG. 3), and NBF generation unit 51 b-k uses this delay matrix H_(NBF)(f) to generate an NBF matrix W(f) having null beamformer (NBF) characteristics. This is obtained by calculating the inverse matrix W(f) of the delay matrix H_(NBF)(f) using the formula W(f)=H_(NBF) ⁻¹(f).

This NBF matrix W(f) is stored in temporary memory unit 90 (FIG. 1). A directional characteristics calculation unit 51 c-k extracts the first row elements W_(1k)(f) of this NBF matrix W(f) together with the values of d_(k) and v_(e) from temporary memory unit 90, and generates the following directional characteristics function for the case where θ is a variable expressing the arrival direction of the signal:

$\begin{matrix} {{{FORMULA}\mspace{14mu} 10}{F\left( {f,\theta} \right)} = {\sum\limits_{k = 1}^{N - V + 1}\;{{W_{1k}(f)}{\exp\left( {{j2\pi}\;{fd}_{k}\cos\;{\theta/v_{e}}} \right)}}}} & (10) \end{matrix}$ where θ is defined in the same way as θ_(i) as described above.

The resulting directional characteristics function F(f,θ) is sent to mask configuration unit 51 d-k. Mask configuration unit 51 d-k uses this directional characteristics function F(f,θ) and the relative values z(f,m) (in this example, z₃(f,m)) read out from temporary memory unit 90 to generate a mask M_(DC)(f,m) with a smooth profile.

This mask M_(DC)(f,m) could, for example, be generated by using the directional characteristics F(f,θ) directly as follows: [Mask 1] M _(DC)(f,m)=F(f,z ₃(f,m))  (11) Or alternatively, the mask M_(DC)(f,m) could be generated by using the absolute values of the directional characteristics F(f,θ) as follows: [Mask 2] M _(DC)(f,m)=|F(f,z ₃(f,m))|  (12)

FIG. 7A shows an example of [Mask 2] (for the case where the number of signals is N=3 and the number of sensors is M=2). The “smooth profile mask” of this example is one that eliminates N−M=1 signal, and has a small gain in one direction a₁. Note that the purpose of this “smooth profile mask” is to extract M(=V)=2 signals (in this case, the two signals arriving from directions a₂ and a₃) as limited signals (the same applies to FIG. 7B and FIG. 7C below).

Or as another example, the mask M_(DC)(f,m) could be generated by transforming the directional characteristics F(f,θ) as follows. Note that in the following, all the region of the relative values z₃(f,m) between two neighboring values of a_(i) in the elements of G_(k) are referred to as a limited signal region. When a₁ or a_(N) is included in G_(k), the region 0°≦z₃(f,m)≦a₁ or 180°≧z₃(f,m)≧a_(N) is also included in the limited signal region. Furthermore, the regions of relative values z₃(f,m) between two neighboring values of a_(i) in the elements of G₀∩G_(k) ^(c) are all referred to as elimination signal regions. When a₁ or a_(N) is included in G₀∩G_(k) ^(c), the region 0°≦z₃(f,m)≦a₁ or 180°≧z also included in the elimination signal region. Regions that do not belong to either the limited signal region or the elimination signal region are referred to as transitional regions.

$\begin{matrix} {{{FORMULA}\mspace{14mu}{11\left\lbrack {{Mask}\mspace{14mu} 3} \right\rbrack}}{{M_{DC}\left( {f,m} \right)} = \left\{ \begin{matrix} {F\left( {f,{z_{3}\left( {f,m} \right)}} \right)} & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon} & {{{Region}\mspace{14mu}{outside}\mspace{14mu}{the}}\mspace{14mu}} \\ \; & \; & {{elimination}\mspace{14mu}{signal}{\mspace{11mu}\;}{region}} \\ {F\left( {f,\theta_{r}} \right)} & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon} & {{Elimination}\mspace{14mu}{signal}\mspace{14mu}{region}} \end{matrix} \right.}} & (13) \\ {\left\lbrack {{Mask}\mspace{14mu} 4} \right\rbrack{{M_{DC}\left( {f,m} \right)} = \left\{ \begin{matrix} {{F\left( {f,{z_{3}\left( {f,m} \right)}} \right)}} & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon} & {{Region}\mspace{14mu}{outside}\mspace{14mu}{the}} \\ \; & \; & {{elimination}\mspace{14mu}{signal}\mspace{14mu}{region}} \\ {{F\left( {f,\theta_{r}} \right)}} & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon} & {{Elimination}\mspace{14mu}{signal}\mspace{14mu}{region}} \end{matrix} \right.}} & (14) \end{matrix}$

These mask functions M_(DC)(f,m) have masking properties that uniformly reduce the gain in the elimination signal region. Here, θ_(r) represents the end of the elimination signal region that is closest to the end of the neighboring limited signal region. FIG. 7B shows an example of this [Mask 4] (for the case where the number of signals is N=3 and the number of sensors is M=2).

It is also possible to use a mask M_(DC)(f,m) with uniform directional characteristics in the limited signal region, for example:

$\quad\begin{matrix} {{{FORMULA}\mspace{14mu}{12\left\lbrack {{Mask}\mspace{14mu} 5} \right\rbrack}}{{M_{DC}\left( {f,m} \right)} = \left\{ \begin{matrix} a & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon\mspace{20mu}{Limited}\mspace{14mu}{signal}\mspace{14mu}{region}} \\ b & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon\mspace{20mu}{Elimination}\mspace{14mu}{signal}\mspace{14mu}{region}} \\ {F\left( {f,{z_{3}\left( {f,m} \right)}} \right)} & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon\mspace{20mu}{Transitional}\mspace{14mu}{region}} \end{matrix} \right.}} & (15) \end{matrix}$ Furthermore, it is possible to use the absolute value of a mask with uniform directional characteristics in the limited signal region, such as:

$\quad\begin{matrix} {\left\lbrack {{Mask}\mspace{14mu} 6} \right\rbrack{{M_{DC}\left( {f,m} \right)} = \left\{ \begin{matrix} a & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon\mspace{20mu}{Limited}\mspace{14mu}{signal}\mspace{14mu}{region}} \\ b & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon\mspace{20mu}{Elimination}\mspace{14mu}{signal}\mspace{14mu}{region}} \\ {{F\left( {f,{z_{3}\left( {f,m} \right)}} \right)}} & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon\mspace{20mu}{Transitional}\mspace{14mu}{region}} \end{matrix} \right.}} & (16) \end{matrix}$

Here, a is set to a value sufficiently greater than zero, such as the maximum value of |F(f,θ)| in the elimination signal region, for example, and b is set to a small value such as the minimum value of the gain of the directional characteristics, for example. FIG. 7C shows an example of [Mask 6] (for the case where the number of signals is N=3 and the number of sensors is M=2). (This ends the description of mask generation unit 51-k/Step S9.)

The mask M_(DC)(f,m) generated by mask generation unit 51-k in this way is stored in temporary memory unit 90 and is then sent to limited signal extraction unit 52-k. Limited signal extraction unit 52-k also reads out the frequency domain observed signal values X(f,m) from temporary memory unit 90. Then, limited signal extraction unit 52-k (FIG. 2) uses this mask M_(DC)(f,m) and the frequency domain observed signal values X(f,m) to generate the limited signal values X_(k)^(f,m) by calculating the product X_(k)^(f,m)=M_(DC)(f,m)X(f,m) (Step S10).

These limited signal values X_(k)^(f,m) are stored in temporary memory unit 90, and limited signal separation unit 60-k reads out these limited signal values X_(k)^(f,m) and performs signal separation on the limited signals (Step S11). Here, an approximation is made by assuming that the limited signal values X_(k)^(f,m)=M_(DC)(f,m)X(f,m) are similar to the values of the mixed signal consisting of the signals emitted from V (2≦V≦M) signal sources. Therefore, to estimate this separation matrix it is possible to use a method based on independent component analysis as discussed in [Conventional method 1]. Specifically, separation is performed using Formula (2) mentioned in [Conventional method 1], for example, using the limited signal values X_(k)^(f,m) as the input values for independent component analysis instead of the observed signal values X.

To perform the ICA separation in this embodiment, the limited signal values X_(k)^(f,m) are first used to generate a separation matrix W(f,m) in ICA separation matrix estimation unit 61-k according to the abovementioned learning rule of Formula (2), and this separation matrix W(f,m) is stored in temporary memory unit 90. This separation matrix W(f,m) is for example generated using feedback from the output values Y_(k)(f,m) from permutation/scaling resolution unit 62-k, which is described below. The resulting separation matrix W(f,m) is sent to permutation/scaling resolution unit 62-k. Permutation/scaling resolution unit 62-k uses this separation matrix W(f,m) and the limited signal values X_(k)(f,m) to generate the respective separated signal values Y_(k)(f,m)=[Y_(k1) ^(Πk1)(f,m), . . . , Y_(kV) ^(ΠkV)(f,m)]^(T) by performing the calculation Y_(k)(f,m)=W(f,m)X_(k)^(f,m), and stores them in temporary memory unit 90. Permutation/scaling resolution unit 62-k then, for example, feeds back these separated signal values Y_(k)(f,m) to resolve the permutation problem with the method mentioned in [Conventional method 1]. After resolving the permutation problem, permutation/scaling resolution unit 62-kthen applies tags Π_(kq) to the separated signal values Y_(kq) (q=1, . . . , V) to show which source signal the separated signal values Y_(kq) (q=1, . . . , V) correspond to, and these are stored together in temporary memory unit 90. Here, these tags Π_(kq) are represented by adding the superscript Πkq to the separated signal values Y_(kq).

For example permutation/scaling resolution unit 62-k might compare the estimated arrival direction θ_(q) of the signal, which is obtained using the inverse matrix of separation matrix W(f) extracted from temporary memory unit 90 (or the Moore-Penrose pseudo-inverse matrix when N≠M) by the following formula:

$\quad\begin{matrix} {{{FORMULA}\mspace{14mu} 13}{\theta_{q} = {\arccos\frac{\arg\left( {\left\lbrack W_{jq}^{- 1} \right\rbrack/\left\lbrack W_{j^{\prime}q}^{- 1} \right\rbrack} \right)}{2\pi\; f\; v_{e}^{- 1}d}}}} & (17) \end{matrix}$

(where v_(e) is the signal velocity and d is the distance between sensor j and sensor j′)

with the representative value included in set G_(k) indicating the variables SG_(k) extracted from temporary memory unit 90, and associates the representative value a_(i) closest to θ_(q) with the q-th separated signal Y_(kq) (Step S12). In other words, permutation/scaling resolution unit 62-k applies tags Π_(kq) to the separated signals Y_(kq) representing the representative values a_(i) (thereby associating them with these representative values).

After that, permutation/scaling resolution unit 62-k extracts the separation matrix W(f) from temporary memory unit 90 and resolves the ICA scaling problem by updating each row W_(q)(f) thereof as follows: w _(q)(f)←[W ⁻¹(f)]_(jq) w _(q)(f) and then stores the updated separation matrix W(f) in temporary memory unit 90. For the subsequent processing in signal combination unit 80, it is desirable that the same value of j is used for the entire series k in this process.

The separated signal values Y_(kq) and their appended tags Π_(kq) are sent to time domain transformation unit 70-k. Time domain transformation unit 70-k uses, for example, a short time inverse discrete Fourier transform or the like to transform each of the separated signal values Y_(kq) (which are obtained in the time-frequency domain) into time-domain signal values, and stores these transformed values in temporary memory unit 90 (Step S13). Note that these time-domain signal values y_(k)(t)=[y_(k1) ^(Πk1)(t), . . . y_(kV) ^(ΠkV)(t)]^(T) are also associated with the abovementioned tags Π_(kq). When these associations are made, time domain transformation unit 70-k first extracts the tags Π_(kq) associated with the frequency-domain signal values Y_(kq) from temporary memory unit 90 for each frequency. Next, time domain transformation unit 70-k judges whether or not the tags Π_(kq) at each frequency are all the same. If they are all the same, the time-domain signal values y_(kq) are tagged by associating them with the tags Π_(kq) applied to the frequency-domain signal values Y_(kq). On the other hand, if they are not all the same then the tags of the time-domain signal values y_(kq) are determined based on a majority decision.

Next, in mask control unit 40, the variables SG and SG_(k) are extracted from temporary memory unit 90, and the union set G^(∪)G_(k) of the sets G and G_(k) represented by these variables is taken as a new set G; this set G is substituted into variable SG, and this variable SG is stored in temporary memory unit 90 (Step S14). Also, mask control unit 40 reads out variables SG and SG₀ from temporary memory unit 90, and judges whether or not this new set G is equal to set G₀ (Step S15). Here, unless G=G₀, the processing returns to Step S7.

On the other hand, if G=G₀, then in signal combination unit 80, the separated signals y_(kp)(t) output from each system k (time domain transformation unit 70-k/k=1, . . . , u) are read out from temporary memory unit 90, and these are selected and combined to yield all N separated signals (Step S16). For example, signal combination unit 80 might first compare the tags Π_(kq) of each separated signal y_(kp)(t) read out from temporary memory unit 90. Here, when it is judged that there are no separated signal values y_(kp)(t) that have the same tag in a plurality of systems k, signal combination unit 80 outputs all the separated signal values y_(kq)(t) as the final separated signal values y_(i)(t) (i=1, . . . , N) (Step S17). On the other hand, when it is judged that there are separated signal values having the same tag in a plurality of systems, signal combination unit 80 either appropriately selects one of these separated signal values with the same tag and outputs it as a final separated signal value y_(i)(t), or calculates the mean of the separated signal values with the same tag and uses this mean value as the output signal (Step S17).

Here, in the process whereby one of the separated signal values y_(kq)(t) is appropriately selected and output as the final separated signal value y_(i)(t), signal combination unit 80 could, for example, determine which of the separated signal values y_(kq)(t) having the same tag a_(i) contains the greatest power, and output it as the final separated signal value y_(i)(t). Also, in the process whereby the mean of the separated signal values having the same tag is output as the final separated signal value y_(i)(t), signal combination unit 80 could, for example, use the following formula:

FORMULA  14 ${{y_{i}(t)} = {\frac{1}{K}{\sum_{\Pi_{{kq} = a_{i}}}{y_{kq}^{\Pi_{kq}}(t)}}}}\;$ (where K is the number of separated signals having the same tag a_(i)) In this way, the N signals are separated with low distortion.

Characteristics of this Embodiment

In the conventional method described in [Conventional method 2: The sparsity method], the distortion of the separated signals increases when the separation performance is increased because when ε in the abovementioned Formula (3) is made sufficiently small to increase the separation performance, the signal components extracted by this binary mask become more restricted and most of the samples that should be extracted as components of the original signals are not extracted. In other words, many zero components are padded into each separated signal, making the separated signals discontinues and generating musical noise.

On the other hand, in this embodiment mixed signals (limited signals) consisting of any number between 2 and M original signals are extracted by a mask having a smooth profile. Consequently, it is possible to extract limited signals of signals (samples) over a wider range of relative values z(f,m) than with the binary mask of [Conventional method 2] which only extracts the values of one signal.

Therefore, even when there are two or more observed signals at the same frequency at the same timing and the sample values are far away from the representative values that they should basically correspond to, there is still a high likelihood of extracting these sample values. As a result, it is possible to suppress the degradation of quality (generation of musical noise) caused by padding zero components into separated signals discontinuously.

Also, in this embodiment, in situations where N (N≧2) signals are mixed together and observed with M sensors, a smooth-profile mask is used to separate and extract the signals. Unlike the masks used in [Conventional method 2] (a binary mask with a value of 0 or 1), a mask with this smooth profile has a profile that extends smoothly at the edges. Consequently, if this smooth-profile mask is used, then even if there are two or more observed signals at the same frequency at a certain timing and the sample relative values are separated from the representative values a₁, . . . , a_(N) that the sample ought to correspond to, the mask for this position may have a nonzero value, and thus it is possible to extract more signals than with a binary mask whose value changes abruptly. As a result, it is possible to suppress quality degradation resulting from zero components being padded discontinuously into the separated signals.

Also, since the smooth-profile mask has values that become smaller with increasing proximity to the edge parts, there is less degradation of the separation performance than in cases where a conventional binary mask is simply used with a greater value of ε.

Furthermore, since the extracted limited signals are thought to consist only of V (≦M) source signals, the separation problem becomes much simpler. Accordingly, signal separation can easily be performed on the limited signals by using [Conventional method 1] and/or [Conventional method 3]. Also, as described in the third embodiment discussed below, when V=1, it is not even necessary to use [Conventional method 1] or [Conventional method 3].

Performance Comparison

In the following, the performance of signal separation performed according to [Conventional method 2] is compared in tabular form with the performance of signal separation performed using [Mask 2] according to the method of this embodiment.

TABLE 1 SIR1 SIR2 SIR3 SDR1 SDR2 SDR3 Conventional 17.3 11.6 17.6 8.1 7.4 7.1 method 2 This — 5.9 17.6 — 13.4 17.4 embodiment 18.5 7.0 — 16.2 13.0 —

In this example, using speech signals from three speakers (two male and one female) as the source signals, mixtures of these signals were produced to simulate the results of observing them in a reverberation-free environment with two omni directional microphones. In the table, SIR stands for “signal to interference noise ratio” (dB), which is an indicator of the separation performance. Also, SDR stands for “signal to distortion ratio” (dB), which is an indicator of the level of distortion in the signal. For both indicators, higher values indicate better performance. Also, SIR1 and SDR1 correspond to speaker 1, SIR2 and SDR2 correspond to speaker 2, and SIR3 and SDR3 correspond to speaker 3. The data for this embodiment is divided vertically into two rows corresponding to the separation results of the k=1 system and the separation results of the k=2 system respectively.

As this table shows, with the method of this embodiment it was possible to obtain SDR values substantially higher than with conventional method 2 with almost no degrading in separation performance SIR. This shows that the separation could be performed with low signal distortion. It can thus be seen that the method of this embodiment is an effective way of separating signals with low distortion in cases where the number of signal sources N is greater than the number of sensors M.

Second Embodiment

This embodiment also relates to the first present invention. This embodiment is an example in which a “smooth-profile mask” is used in the limited signal generation unit, and a separation method based on the estimation of a mixing matrix is used in the limited signal separation unit. Note that in this embodiment, the description of items that are the same as in the first embodiment is omitted.

FIG. 8 shows a block diagram illustrating just one of the systems used to obtain V separated signal values in a signal separation device according to this embodiment.

In FIG. 8, configurations that are the same as in the first embodiment are labeled with the same reference numerals as in the first embodiment. As shown by the example in FIG. 8, the signal separation device of this embodiment differs from the signal separation device 1 of the first embodiment in that limited signal generation unit 50-k is replaced with limited signal generation unit 150-k, and limited signal separation unit 60-k is replaced with limited signal separation unit 160-k. It also differs in that mask generation unit 151-k produces two types of mask, and in that the restriction V=M is imposed. The configuration and processing of this embodiment are described below.

First, representative value generation unit 30 (FIG. 8) extracts the frequency domain observed signal values X_(j)(f,m) generated by frequency domain transformation unit 20 (FIG. 1) from temporary memory unit 90. Next, representative value generation unit 30 (FIG. 8) calculates the relative values z(f,m) of the observed values in relative value calculation unit 31 in the same way as in the first embodiment, clustering is performed in clustering unit 32, and the representative values a₁, a₂, . . . , a_(N) are calculated in representative value calculation unit 33. Note that in this embodiment, for the relative values z(f,m) it is preferable to use the arrival directions of signals obtained from the phase differences z₁(f,m) between the observed signals at any two sensors (the i-th and j-th sensors) as follows:

FORMULA  15 ${z_{3}\left( {f,m} \right)} = {\cos^{- 1}\frac{{z_{1}\left( {f,m} \right)}v_{e}}{2\pi\;{fd}}}$

These representative values a₁, a₂, . . . , a_(N) are stored in temporary memory unit 90 (FIG. 1), and are then sent via mask control unit 40 (FIG. 8) to the mask generation unit 151-k of limited signal generation unit 150-k, whereby mask generation unit 151-k produces two types of mask. One is a mask for extracting the limited signal values X^(f,m) containing a mixture of V (=M) signals corresponding to V (=M) representative values included in G_(k); this is the smooth-profile mask M_(DC)(f,m) shown in the first embodiment. The other is a binary mask M_(k)(f,m) that extracts signals including only one signal; this is the same sort of mask as the one shown in [Conventional method 2] and is defined as follows:

$\quad\begin{matrix} {{{FORMULA}\mspace{14mu} 16}{M_{k}\left( {f,m} \right)} = \left\{ {\begin{matrix} 1 & {{a_{k} - ɛ} \leq {z\left( {f,m} \right)} \leq {a_{k} + ɛ}} \\ 0 & {otherwise} \end{matrix}\left( {{k = 1},\ldots\mspace{11mu},N} \right)} \right.} & (18) \end{matrix}$ These masks are stored in temporary memory unit 90 (FIG. 1).

Next, limited signal extraction unit 152-k (FIG. 8) reads out the smooth-profile mask M_(DC)(f,m) and the frequency-domain observed signal values X(f,m) from temporary memory unit 90 (FIG. 1). Limited signal extraction unit 152-k (FIG. 8) then calculates the limited signal values X^(f,m)=M_(DC)(f,m)X(f,m) by multiplying the frequency-domain observed signal values X(f,m) by this mask M_(DC)(f,m), and stores the results in temporary memory unit 90 (FIG. 1). Here, since these limited signal values X^(f,m) are approximated by a mixture of V signals, the separation of signals in limited signal separation unit 160-k can be performed by applying the mixing matrix estimation method discussed in [Conventional method 3].

Therefore, in multiplication arithmetic unit 161-k of limited signal separation unit 160-k (FIG. 8), the binary mask M_(k)(f,m) and frequency-domain observed signal values X(f,m) are first read out from temporary memory unit 90 (FIG. 1). Then, multiplication arithmetic unit 161-k (FIG. 8) determines the separated signal values X_(k)^(f,m) including just one signal by performing the calculation X_(k)^(f,m)=M_(k)(f,m)X(f,m), and stores it in temporary memory unit 90 (FIG. 1). Next, mixing process estimation unit 162-k (FIG. 8) reads out X_(k)^(f,m) from temporary memory unit 90 (FIG. 1) and calculates the estimated mixing matrix H^ in the same way as in [Conventional method 3] as follows:

FORMULA  17 ${{\hat{H}}_{ji}(f)} = {{E\left\lbrack \frac{{M_{i}\left( {f,m_{i}} \right)}{X_{j}\left( {f,m_{i}} \right)}}{{M_{i}\left( {f,m_{i}} \right)}{X_{1}\left( {f,m_{i}} \right)}} \right\rbrack}\mspace{76mu} = {{E\left\lbrack \frac{{\hat{X}}_{j}\left( {f,m_{i}} \right)}{{\hat{X}}_{1}\left( {f,m_{i}} \right)} \right\rbrack} = {{E\left\lbrack \frac{{H_{ji}(f)}{S_{i}\left( {f,m_{i}} \right)}}{{H_{1i}(f)}{S_{i}\left( {f,m_{i}} \right)}} \right\rbrack} = {E\left\lbrack \frac{H_{ji}(f)}{H_{1i}(f)} \right\rbrack}}}}$ This mixing matrix H^ is an N×M matrix. It is not necessary to determine this mixing matrix for every series k, and instead the matrix H^estimated for one series may be used by storing it in temporary memory unit 90 and sequentially reading it out.

This mixing matrix H^ is sent to inverse matrix calculation unit 163-k, and inverse matrix calculation unit 163-k first drops ranks from this mixing matrix. Specifically, V×V square matrix H^_(M) is produced by only reading out the V columns of the mixing matrix H^ that correspond to the limited signals X^(f,m) consisting of V signals (i.e., the columns corresponding to the V representative values a_(i) included in G_(k)). This is done in order to separate the limited signals X^(f,m) approximated by a mixture of V signals.

Next, inverse matrix calculation unit 163-k calculates the inverse matrix H^_(M) ⁻¹(f) of this square matrix H^(m), and stores it in temporary memory unit 90 (FIG. 1). Multiplication arithmetic unit 164-k (FIG. 8) reads out the limited signal values X^(f,m) and inverse matrix H^_(M) ⁻¹(f) from temporary memory unit 90 (FIG. 1), and performs the calculation Y_(k)(f,m)=H^_(M) ⁻¹(f)X^(f,m) to calculate the estimated values of the V separated signals Y_(k)(f,m)=[Y_(k1) ^(Πk1)(f,m), . . .,Y_(kV) ^(ΠkV)(f,m)]^(T). Note that the appending of tag information to indicate which source signals the separated signals Y_(kq)(q=1, . . . , V) correspond to is performed by using H^_(M) instead of W⁻¹ in the abovementioned Formula (17) to determine the estimated arrival direction of the signal, and then judging which of the representative values a_(i) this direction is close to.

Third Embodiment

This embodiment is also an embodiment relating to the first present invention. In this embodiment, a “smooth-profile mask” is used to extract only a signal consisting of the signal emitted from any one signal source (called a “limited signal” in this embodiment) from the observed signals, and the extracted limited signal is taken to be the separated signal. Note that in this embodiment, the description of items that are the same as in the first embodiment is omitted.

FIG. 9 is a block diagram showing an example of one system part of a signal separation device according to this embodiment, whereby one separated signal is obtained. Note that in FIG. 9, configurations that are the same as in the first embodiment are labeled with the same reference numerals as in the first embodiment.

As shown by the example in FIG. 9, the signal separation device of this embodiment differs from the signal separation device 1 of the first embodiment in that limited signal generation unit 50-k is replaced with limited signal generation unit 250-k, and in that there is no limited signal separation unit 60-k in the signal separation device of this embodiment. The configuration and processing of this embodiment are described below.

First, representative value generation unit 30 (FIG. 9) extracts the frequency-domain observed signal values X_(j)(f,m) generated by frequency domain transformation unit 20 from temporary memory unit 90 (FIG. 1). Representative value generation unit 30 (FIG. 9) calculates the relative values z(f,m) of the observed values in relative value calculation unit 31 in the same way as in the first embodiment, clustering is performed in clustering unit 32, and the representative values a₁, a₂, . . . , a_(N) are calculated in representative value calculation unit 33. For the relative values z(f,m), it is possible to use the phase differences and/or amplitude ratios, or a mapping thereof (e.g., the arrival directions of signals as determined from the phase differences). The relative values used in this embodiment are the arrival directions of signals as determined from the phase differences between the observed signals as follows:

FORMULA  18 ${z_{3}\left( {f,m} \right)} = {\cos^{- 1}\frac{{z_{1}\left( {f,m} \right)}v_{e}}{2\pi\;{fd}}}$

These representative values a₁, a₂, . . . , a_(N) are stored in temporary memory unit 90 (FIG. 1), and these representative values a₁, a₂, . . . , a_(N) are then read out by mask generation unit 251-k of limited signal generation unit 250-k (FIG. 9), whereby mask generation unit 251-k produces a “smooth-profile mask” for extracting any one of these representative values a_(i). Note that the “smooth-profile mask” of this embodiment is a function that takes a high level value for relative values in a limited range including V (V=1) representative values, and takes a low level value for representative values that are not inside this limited range, and where the transitions from the high level value to the low level value that accompany changes of the relative value occur in a continuous fashion.

A technique for generating a “smooth-profile mask” according to this embodiment is described below.

First, mask generation unit 251-k generates an (N×N) delay matrix H_(NBF)(f). Specifically, mask generation unit 251-k extracts one of the representative values a₁, a₂, . . . , a_(N) (estimated values of the arrival directions of extracted signals) stored in temporary memory unit 90 (FIG. 1), which is denoted as θ₁. Mask generation unit 251-k also extracts the other N−1 representative values (the estimated values of the arrival directions of the signals that are not extracted) from temporary memory unit 90 (FIG. 1), which are denoted as θ_(i) (i2, . . . , N). These values of θ₁ and θ_(i) are stored in temporary memory unit 90 (FIG. 1). Mask generation unit 251-k sequentially extracts θ₁ and θ_(i)from temporary memory unit 90, calculates τ_(ji)=(d_(j)/v_(e))cos θ_(i) (j=1, . . . , N) and the elements at (j,i) in delay matrix HNBF(f) H_(NBFji)(f)=exp(j2πfτ_(ji)), and sequentially stores the results in temporary memory unit 90. Here, d_(j) is the distance between sensor 1 and sensor j (d₁=0), f is a frequency variable, and v_(e) is the signal velocity. These parameters could, for example, be pre-stored in temporary memory unit 90 and sequentially read out when required. The above process results in the generation of an (N×N) delay matrix H_(NBF)(f).

Next, mask generation unit 251-k uses this delay matrix H_(NBF)(f) to produce an NBF matrix W(f) with null beamformer (NBF) characteristics. This is obtained by calculating the inverse matrix W(f) of the delay matrix H_(NBF)(f) using the formula W(f)=H_(NBF) ⁻¹(f). This NBF matrix W(f)=H_(NBF) ⁻¹(f) is stored in temporary memory unit 90. Then, mask generation unit 251-k sequentially extracts the first row elements W_(1k)(f) of NBF matrix W(f) and the values of d_(k) and v_(e) from temporary memory unit 90, and generates the directional characteristics function F(f,θ) shown in Formula (10) above. After that, mask generation unit 251-k uses this directional characteristics function F(f,θ) to generate a smooth-profile mask M_(DC)(f,m).

For example, a mask represented by Formula (11) (referred to as [Mask 7]) or a mask represented by Formula (12) (referred to as [Mask 8]) in the first embodiment might be generated as the smooth-profile mask M_(DC)(f,m) of this embodiment.

Also, for example, it is possible to generate a [smooth-profile mask] having characteristics whereby the gain in the elimination signal region is made uniformly small as follows:

$\quad\begin{matrix} {{{FORMULA}\mspace{14mu} 19}{{Mask}\mspace{14mu} 9}{{M_{DC}\left( {f,m} \right)} = \left\{ \begin{matrix} {F\left( {f,{z_{3}\left( {f,m} \right)}} \right)} & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon} & {{{Region}\mspace{14mu}{outside}\mspace{14mu}{the}}\mspace{14mu}} \\ \; & \; & {{{elimination}\mspace{20mu}{signal}}{\mspace{11mu}\;}} \\ {F\left( {f,\theta_{r}} \right)} & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon} & {{Elimination}\mspace{14mu}{signal}\mspace{14mu}{region}} \end{matrix} \right.}} & (19) \\ {{{Mask}\mspace{14mu} 10}{{M_{DC}\left( {f,m} \right)} = \left\{ \begin{matrix} {{F\left( {f,{z_{3}\left( {f,m} \right)}} \right)}} & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon} & {{Region}\mspace{14mu}{outside}\mspace{14mu}{the}} \\ \; & \; & {{{elimination}\mspace{14mu}{signal}}\mspace{14mu}} \\ {{F\left( {f,\theta_{r}} \right)}} & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon} & {{Elimination}\mspace{20mu}{signal}\mspace{14mu}{region}} \end{matrix} \right.}} & (20) \end{matrix}$

Here, of the estimated values of the arrival directions of the N−1 signals that are to be eliminated (i.e., the N−1 representative values other than the representative value a_(i) to be extracted), θ_(r) is the one closest to the estimated value of the arrival direction of the signal that is not eliminated (the extracted representative value a_(i)), for example.

It is also possible to use a mask M_(DC)(f,m) with uniform directional characteristics in the extracted direction such as, for example:

$\quad\begin{matrix} {{{FORMULA}\mspace{14mu} 20}{{Mask}\mspace{14mu} 11}{{M_{DC}\left( {f,m} \right)} = \left\{ \begin{matrix} {{F\left( {f,\theta_{1}} \right)}} & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon} & {{Limited}\mspace{14mu}{signal}\mspace{14mu}{region}} \\ {{F\left( {f,\theta_{r}} \right)}} & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon} & {{Elimination}\mspace{20mu}{signal}\mspace{14mu}{region}} \\ {F\left( {f,{z_{3}\left( {f,m} \right)}} \right)} & {{z_{3}\left( {f,m} \right)}\mspace{14mu}\varepsilon} & {{Transitional}\mspace{14mu}{region}} \end{matrix} \right.}} & (21) \end{matrix}$ It is also possible to use M_(DC)(f,m)=|F(f,z₃(f,m))| in the transitional region ([Mask 12]).

Examples of the abovementioned [Mask 8] and [Mask 12] are shown in FIG. 10. These are examples of “smooth-profile masks” that extract signals arriving from direction a_(i) and suppress signals arriving from directions a₂ and a₃ when the number of signals is N=3 and the number of sensors is M=2.

The smooth-profile mask M_(DC)(f,m) generated in mask generation unit 251-k is sent to limited signal extraction unit 252-k, and limited signal extraction unit 252-k extracts the separated signal Y_(k)(f,m) according to the formula Y_(k)(f,m)=M_(DC)(f,m)X_(j)(f,m).

The above process is performed in a plurality of systems until all the separated signals have been extracted, finally yielding all the separated signals Y(f,m). The signal separation device then restores these separated signals Y(f,m) to the time domain in the time domain transformation unit, and these signals are output by passing them straight through the signal combination unit.

Performance Comparison

In the following, the performance of signal separation performed according to [Conventional method 2] is compared in tabular form with the performance of signal separation performed using [Mask 8] and [Mask 11] according to the method of this embodiment.

TABLE 2 SIR1 SDR1 SIR2 SDR2 SIR3 SDR3 Conventional 15.0 7.9 10.3 11.1 17.3 9.0 method 2 This 14.8 12.1 5.9 17.2 14.6 11.1 embodiment (Mask 8) This 15.4 13.0 8.3 16.1 16.1 11.4 embodiment (Mask 11)

In this example, using speech signals from three speakers (two male and one female) as the source signals, mixtures of these signals were produced to simulate the results of observing them in a reverberation-free environment with two non-directional microphones.

TABLE 3 SIR1 SDR1 SIR2 SDR2 SIR3 SDR3 Conventional 15.1 11.3 9.0 13.3 13.4 9.2 method 2 This 14.6 11.4 5.5 17.2 14.3 11.6 embodiment (Mask 8) This 15.5 12.2 7.9 16.0 15.4 11.7 embodiment (Mask 11)

This example shows the simulated results obtained under the same conditions as in Table 2 except that the signals were mixed differently (specifically, the positional arrangement of the speakers was changed).

TABLE 4 SIR1 SDR1 SIR2 SDR2 SIR3 SDR3 Conventional 11.0 7.7 4.3 10.8 13.4 6.4 method 2 This 10.8 7.8 2.7 16.5 12.9 7.6 embodiment (Mask 8) This 12.0 8.7 3.5 15.7 14.9 7.1 embodiment (Mask 11)

This example shows the simulated results obtained under the same conditions as in Table 2 except for the member of speakers(three male).

As these tables show, with the method of this embodiment it was possible to obtain SDR values substantially higher than with conventional method 2 with almost no degrading in separation performance SIR. This shows that separation could be performed with low signal distortion. It can thus be seen that the method of this embodiment is an effective way of separating signals with low distortion in cases where the number of signal sources N is greater than the number of sensors M.

Fourth Embodiment

This embodiment also relates to the first present invention. In this embodiment, a smooth-profile mask is generated by convolving a binary mask with a smooth profile function. In the following, only the processing performed in the mask generation unit (equivalent to mask generation unit 51-k in FIG. 1) is described. The other configurations and processes are the same as in the first through third embodiments. In this embodiment, the relative values z(f,m), could be derived from the parameters described in the first embodiment, such as the phase differences z₁(f,m), amplitude ratios z₂(f,m), or the arrival directions z₃(f,m) obtained from the phase differences z₁(f,m).

FIG. 11 shows a block diagram of an example of the configuration of mask generation unit 300-k in this embodiment.

When the processing of mask generation unit 300-k is started, binary mask preparation unit 301-k first generates a binary mask which is a function that takes a high level value for relative values inside a prescribed range including V representative values and a low level value for relative values that are not inside this range, and where the transitions from the high level value to the low level value that accompany changes of the relative value occur in a discontinues fashion. For example, mask generation unit 300-k might generate a binary mask for extracting signals consisting of V mixed signals according to the following formula:

FORMULA  21 ${F_{b}(z)} = \left\{ \begin{matrix} 1 & {a_{\min} \leq z \leq a_{\max}} \\ 0 & {otherwise} \end{matrix} \right.$

When extracting a signal that includes V representative values from a_(k+1) to a_(k+V), the parameters a_(min) and a_(max) could, for example, be set in the ranges a_(k)<a_(min)<a_(k+1) and a_(k+V)<a_(max)<a_(k+v+1). These parameters may be set appropriately, but more specifically a_(min) and a_(max) can be calculated by the following process, for example.

First, mask generation unit 300-k reads in the relative values z(f,m), clusters C_(i) and representative values a_(i) (i=1, . . . , N) from temporary memory unit 90 (FIG. 1) (see Steps S3-5 of the first embodiment), and calculates the variance value of each cluster C1 from the following calculation:

$\begin{matrix} \text{FORMULA~~22} & \; \\ {{\sigma^{2}(f)}_{i} = {\left( {1/{C_{1}}} \right){\sum\limits_{m \in T_{i}}\left( {{z\left( {f,m} \right)} - {a_{i}(f)}} \right)^{2}}}} & (22) \end{matrix}$ where |C_(i)| is the number of relative values z(f,m) that belong to cluster C_(i). This variance value can also be obtained by using, for example, an EM algorithm (see, e.g., Richard O. Duda, “Pattern Classification (2^(nd) ed.),” John Wiley & Sons, Inc., ISBN 0-471-05669-3) or the like, and fitting the data to a Gaussian model.

The calculated variance values σ² _(i) are stored in temporary memory unit 90 (FIG. 1), and then mask generation unit 301-k (FIG. 1) reads in the variance values σ² _(i) and representative values a_(i) (in this example, the mean values of the clusters C_(i)) stored in temporary memory unit 90, and uses them to perform the following calculation:

$\quad\begin{matrix} {{{FORMULA}\mspace{14mu} 23}{a_{\min} = \frac{{\sigma_{k + 1} \cdot a_{k}} + {\sigma_{k} \cdot a_{k + 1}}}{\sigma_{k + 1} + \sigma_{k}}}{a_{\max} = \frac{{\sigma_{k + V} \cdot a_{k + V + 1}} + {\sigma_{k + V + 1} \cdot a_{k + V}}}{\sigma_{k + V} + \sigma_{k + V + 1}}}} & (23) \end{matrix}$ (This ends the description of the specific calculation example of a_(min) and a_(max).)

The binary mask F_(b)(z) generated in this way is stored in temporary memory unit 90 (FIG. 1).

Next, a single-peak function generator unit 302-k (FIG. 11) generates a single-peak function g(z) whose value changes continuously with changes in z, and stores it in temporary memory unit 90 (FIG. 1). As an example of single-peak function g(z), it is possible to use a function with a smooth profile such as the following Gaussian function:

FORMULA  24 ${g(z)} = {\frac{1}{\sqrt{2{\pi\sigma}^{2}}}\exp\left\{ {{- \frac{1}{2}}\left\{ \frac{z}{\sigma} \right\}^{2}} \right\}}$ Here, σ represents the standard deviation of g(z). For example, when extracting the range a_(k+1) through a_(k+V), it is preferable to set σ to a suitable value so that a_(min)−σ>a_(k)+σ_(k) and a_(max)+σ<a_(k+V+1)−σ_(k+V+1), e.g., by choosing σ so that σ=min(σ_(k),σ_(k+V+1)). Here, σ_(k) and σ_(k+V+1) are given by Formula (22). Also, the notation min(α,β) represents the operation of extracting the smaller of the values α and β.

Next, a convolutional mixing unit 303-k (FIG. 11) reads in binary mask F_(b)(z) and single-peak function g(z) from temporary memory unit 90 (FIG. 1), calculates the convolution of this binary mask F_(b)(z) with the single-peak function g(z) with the function F(z)=F_(b)(z)*g(z), and stores it in temporary memory unit 90 (FIG. 1). Here, the symbol * is a convolution operator for the variable z.

After that, mask configuration unit 304-k (FIG. 11) reads in the relative values z(f,m) and function F(z) from temporary memory unit 90 (FIG. 1), generates a mask by substituting the relative values z(f,m) into function F(z) as follows: M _(DC)(f,m)=F(z(f,m))  (24) and stores this mask in temporary memory unit 90 (FIG. 1).

Alternatively, the mask of Formula (24) could be obtained using a smooth-profile function F(z) that produces a mask profile where the ends of a binary mask F_(b)(z) have straight-line (or curved) segments with a given gradient.

The mask of Formula (24) could also be obtained by using a mask configuration unit 304-k (FIG. 11) to read in the representative values a_(i) (in this example, the mean values of clusters C_(i)) and the values of a_(min), a_(max) and variance values (σ² _(i) obtained as shown in Formula (22) and Formula (23), calculate a Gaussian function with a mean of a_(i)(f) and a variance of σ² _(i)(f):

FORMULA  25 ${g_{i}(z)} = {\frac{1}{\sqrt{2{\pi\sigma}_{i}^{2}}}\exp\left\{ {{- \frac{1}{2}}\left\{ \frac{z - a_{i}}{\sigma_{i}} \right\}^{2}} \right\}}$ normalize this Gaussian function by replacing g_(i)(z) with g_(i)(z)/g_(i)(a_(i)) so that the value at a_(i) becomes 1, and then perform the following calculation:

${F(z)} = \left\{ \begin{matrix} {g_{k}(z)} & {a_{\min} > z} \\ 1 & {a_{\min} \leq z \leq a_{\max}} \\ g_{k + V} & {a_{\max} < z} \end{matrix} \right.$

Fifth Embodiment

This embodiment also relates to the first present invention. In this embodiment, a smooth-profile mask is generated from the differences between odd functions. In the following, only the processing performed in the mask generation unit (equivalent to mask generation unit 51-k in FIG. 1) is described. Note that the other configurations and processes are the same as in the first through third embodiments.

The mask generation unit of this embodiment generates a smooth-profile mask from a single-peak function obtained by mapping the differences between a first odd function that is zero when the relative value is the lower limit value a_(min) of a limited range and a second odd function that is zero when the relative value is the upper limit value a_(max) of a limited range. For example, a “smooth-profile mask” could be made using the following function: M _(DC)(f,m)={tan h(z(f,m)−a _(min))−tanh(z(f,m)−a_(max))}^(α) Note that for the relative values z(f,m), this embodiment uses the phase differences z₁(f,m) and/or amplitude ratios z₂(f,m) shown in the first embodiment and the like, or a mapping thereof (e.g., the arrival directions z₃(f,m) of signals as determined from the phase differences, or the like). Also, α is any positive number, and the values of a_(min) and a_(max) are obtained in the same way as in the fourth embodiment. If necessary normalization may also be performed using a formula such as the following: M _(DC)(f,m)=M _(DC)(f,m)/max(M _(DC)(f,m))

Sixth Embodiment

This embodiment also relates to the first present invention. A mask according to this embodiment is generated in mask generation unit 51-k shown in FIG. 1 and FIG. 2, and is a function (binary mask) that takes a high level value for relative values inside a prescribed range including V representative values and a low level value for representative values that are not inside this prescribed range, and where the transitions from the high level value to the low level value occur in a discontinues fashion. Here, 2≦V≦M. As a specific example, a mask could be generated according to the following formula:

$\quad\begin{matrix} {{{FORMULA}\mspace{14mu} 26}{{B\left( {f,m} \right)} = \left\{ \begin{matrix} 1 & {a_{\min} \leq {z\left( {f,m} \right)} \leq a_{\max}} \\ 0 & {otherwise} \end{matrix} \right.}} & (25) \end{matrix}$ Note that when extracting a signal including V representative values from a_(k+1) to a_(k+V), the parameters a_(min) and a_(max) could, for example, be set in the ranges a_(k)<a_(min)<a_(k+1) and a_(k+V)<a_(max)<a_(k+V+1). More specifically, a_(min) and a_(max) could, for example, be generated according to the same procedure as the method discussed in the fourth embodiment. In this embodiment, the relative values z(f,m) could be derived from parameters such as the phase differences z₁(f,m), amplitude ratios z₂(f,m), or the arrival directions z₃(f,m) obtained from the phase differences z₁(f,m).

Furthermore, the number of relative values z(f,m) included in the range from a_(min) to a_(max) should be at least as much as 2 and no greater than the number of sensors M, and should preferably be equal to the number of sensors M. As in the first embodiment, a plurality of binary masks B(f,m) are generated in this embodiment.

As a specific example, mask control unit 40 (FIG. 1, FIG. 2) reads out the representative values a₁, a₂, . . . , a_(N) from temporary memory unit 90, substitutes the data specifying a set G₀ whose elements are these representative values a₁, a₂, . . . , a_(N) into a variable SG₀, and stores this variable SG₀ in temporary memory unit 90. Mask control unit 40 also initializes a variable SG specifying a set G to G=Ø (the empty set), and a variable k is set to zero; these are stored in temporary memory unit 90 (FIG. 4; Step S6). Next, under the control of mask control unit 40, processing is performed in a plurality of systems (u systems) in limited signal generation unit 50-k (k=1, . . . , u), limited signal separation unit 60-k and time domain transformation unit 70-k until all N separated signals have been obtained. First, mask control unit 40 adds 1 to the value of variable k stored in temporary memory unit 90 to obtain a new value for variable k which is stored back in temporary memory unit 90 (FIG. 4; Step S7). Next, mask control unit 40 retrieves the variables SG₀ and SG from temporary memory unit 90. Then, in mask control unit 40, a set G_(k) is selected consisting of V (≦M) suitable representative values including the members of the complementary set G^(c) of the set G specified by SG (the notation α^(c) represents the complementary set of α), the data specifying this set G_(k) is substituted into variable SG_(k), and this variable SG_(k) is stored in temporary memory unit 90 (FIG. 4; Step S8). The mask generation unit 51-k of limited signal generation unit 50-k reads out the variable SG_(k) stored in temporary memory unit 90, and produces a binary mask that extracts signals in the clusters whose representative values are in the set G_(k) specified by this variable SG_(k) (FIG. 4; Step S9).

FIG. 12A shows an example of a binary mask in this embodiment. This is an example of a binary mask that takes a high level value (e.g., 1) for relative values z₃(f,m) inside a prescribed range that includes two representative values a₁ and a₂, and takes a low level value (e.g., 0) for representative value a₃ which is not inside this prescribed range. The vertical axis of this figure represents the gain of the binary mask, and the horizontal axis represents the relative value z₃(f,m) (the DOA (direction of arrival ) of the signal in degrees). As this figure shows, the high level values of this binary mask are flat, and the transitions between the high level value and the low level value are discontinues.

Note that the other configurations and processes are the same as in the first and second embodiments. Specifically, this embodiment extracts the values of a mixed signal (called a “limited signal” in this embodiment) comprising the signals emitted by V signal sources from the frequency domain values by using a binary mask B(f,m) instead of the smooth-profile mask M_(DC)(f,m) used in the first and second embodiments, and then performs the processing of the first or second embodiment.

Also, the processing whereby binary mask B(f,m) is used to extract the values of a mixed signal comprising the signals emitted by V signal sources from the frequency domain signal values is performed by multiplying the frequency domain observed signal values X_(j)(f,m) by the binary mask B(f,m) (X^(f,m)=B(f,m)X(f,m)).

Characteristics of this Embodiment

In the conventional method described in “Conventional method 2: The sparsity method”, the distortion of the separated signals increases when the separation performance is increased because when ε in the abovementioned Formula (3) is made sufficiently small to increase the separation performance, the signal components extracted by this binary mask become more restricted and most of the samples that should be extracted as components of the original source signal are not extracted. In other words, many zero components are padded into each separated signal, making the separated signals discontinues and generating musical noise.

On the other hand, in this embodiment mixed signals (limited signals) consisting of any number between 2 and M source signals are extracted by a binary mask B(f,m). Consequently, it is possible to extract limited signals of signals (samples) over a wider range of relative values z(f,m) than with the binary mask of [Conventional method 2] which only extracts the values of one signal. For example, in the example shown in FIG. 12A, it is possible to extract not only sample values whose relative value z(f,m) lies in the vicinity of representative values a₁ and a₂, but also sample values whose relative value z(f,m) is positioned between a₁ and a₂. Also, a sample that is positioned between a₁ and a₂, for example, is highly likely to be a sample that corresponds to the representative value of a₁ or a₂.

Therefore, even when there are two or more observed signals at the same frequency at the same timing and the sample values are separated from the representative values that they should basically correspond to, there is still a high likelihood of extracting these sample values. As a result, it is possible to suppress the degradation of quality (generation of musical noise) that occurs due to padding zero components into discontinues separated signals.

Verification of the Effects of Zero-Padding with a Binary Mask

In the following the effects of zero-padding with a binary mask are discussed with regard to the case where the speech signals s₁, s₂ and s₃ of three speakers are observed with two omni directional microphones (i.e., N=3, M=2).

If the proportion of the signal power lost as a result of zero-padding by using the binary mask is defined as follows:

$\quad\begin{matrix} {{{{FORMULA}\mspace{14mu} 27}\text{}{\frac{{\sum\limits_{t}\;{{s_{i}(t)}}^{2}} - {\sum\limits_{t}\;{{y_{i}(t)}}^{2}}}{\sum\limits_{t}{{s_{i}(t)}}^{2}} \times 100}}\mspace{14mu}} & (26) \end{matrix}$ then the proportion of the signal power lost by the binary mask in the conventional method of “Conventional method 2: the sparsity method” was as follows: s₁: 17%, s₂: 14%, s₃: 23%.

On the other hand, the signal power degradation of the binary mask B(f,m) according to this embodiment was s₁: 2.5%, s₂: 5.7% for the case where the two signals s₁ and s₂ were mixed together, and s₂: 8.1%, s₃: 0.7% for the case where the two signals s₂ and s₃ were mixed together.

Thus, in this embodiment the degradation of the signals by the binary mask B(f,m) is less than in the conventional method. This indicates that musical noise is less likely to be generated in this embodiment.

Performance Comparison

The simulation results obtained with this embodiment are shown below.

TABLE 5 SIR1 SIR2 SIR3 SDR1 SDR2 SDR3 Conventional 15.4 10.3 14.6 9.8 11.9 9.2 method 2 This — 8.4 16.4 — 15.0 20.9 embodiment 13.1 8.2 — 17.4 13.8 —

In this example, limited signals are extracted with a binary mask according to this embodiment, and signal separation is performed on these limited signals by supplying them to an ICA process. Also, in this example, using speech signals from three speakers (two male and one female) as the source signals, mixtures of these signals were produced to simulate the results of observing them in an anechoic environment with two omni-directional microphones. As this tables shows, with the method of this embodiment it was possible to obtain SDR values substantially higher than with conventional method 2 with almost no degrading in separation performance SIR. This shows that the separation could be performed with much lower distortion in the method of this embodiment.

Seventh Embodiment

This embodiment also relates to the first present invention, and is a variant of the abovementioned sixth embodiment. That is, this embodiment also uses a binary mask to extract a limited signal in cases where 2≦V≦M, but it differs in terms of the method used to produce the binary mask B(f,m) and the limited signal calculation processing. In the following, only the method used to produce the binary mask B(f,m) and the limited signal calculation processing are described; the other aspects of the processing and functional configuration are the same as in the first embodiment or second embodiment, so their description is omitted.

The purpose of a binary mask B(f,m) according to this embodiment is to extract observed signal components other than the abovementioned limited signal. That is, a binary mask B(f,m) produced by a mask generation unit according to this embodiment is a function that takes a low level value for relative values inside a prescribed range including V representative values (this set is referred to as G_(k)) and a high level value for representative values that are not inside this prescribed range (G_(k) ^(c)), and where the transitions from the high level value to the low level value occur in a discontinues fashion. Here, 2≦V≦M.

Specifically, a mask generation unit 51-k according to this embodiment generates a binary mask as shown by Formula (3) above for the representative values included in set G_(k) ^(c), for example. In this embodiment, the relative values z(f,m) could be derived from parameters such as the phase differences z₁(f,m), amplitude ratios z₂(f,m), or the arrival directions z₃(f,m) obtained from the phase differences z₁(f,m). FIG. 12B shows an example of a binary mask B(f,m) according to this embodiment. This is an example of a binary mask that takes a low level value (e.g., 0) for relative values z₃(f,m) inside a prescribed range that includes V=2 representative values a₁, and a₂, and takes a high level value (e.g., 1) for representative value a₃ which is not inside this prescribed range. The vertical axis of this figure represents the gain of the binary mask, and the horizontal axis represents the relative value z₃(f,m) (the arrival direction of the signal in degrees). As this figure shows, the high level values of this binary mask are flat, and the transitions between the high level value and the low level value are discontinues.

The limited signal extraction unit of this embodiment extracts limited signal values X^(f,m) by subtracting the product of this binary mask B(f,m) and the frequency domain signal values X_(j)(f,m) from the frequency domain signal values X_(j)(f,m). For example, by producing binary masks M_(i)(f,m) as shown in Formula (3) above for N−M representative values included in set G_(k) ^(c), the values X^(f,m) of a limited signal consisting only of M source signals can be calculated by performing the following calculation:

$\quad\begin{matrix} {{{FORMULA}\mspace{14mu} 28}{{\hat{X}\left( {f,m} \right)} = {{X\left( {f,m} \right)} - {\sum\limits_{G_{k}^{c}}\;\left\{ {{M_{i}\left( {f,m} \right)}{X\left( {f,m} \right)}} \right\}}}}} & (27) \end{matrix}$ Although the abovementioned binary masks M_(i)(f,m) of Formula (3) are binary masks that take a high level value for only one representative value each, the processing of this embodiment can also be implemented using binary masks that take a high level value for 2 or more representative values. Also, instead of a binary mask, the processing of this embodiment may be implemented using a smooth-profile mask as described above.

When a limited signal X^(f,m) has been calculated, the subsequent limited signal separation, time domain transformation and signal combination processes can be performed in the same way as in the first embodiment or second embodiment.

Eighth Embodiment

This embodiment relates to the second present invention, in which masks are defined by clustering the observed values in M-dimensional domains when the signals are observed with M sensors. The following description focuses on the differences between this embodiment and the first embodiment, and the description of items that are the same as in the first embodiment is omitted.

FIG. 13 shows a block diagram of an example of the configuration of representative value generation unit 430, mask control unit 40 and limited signal generation unit 450-k in this embodiment. This figure only shows one system that obtains V separated signals. In this embodiment, 1≦V≦M.

The signal separation device of this embodiment differs structurally from signal separation device 1 of the first embodiment in the representative value generation unit and limited signal generation unit. Specifically, this embodiment is provided with a representative value generation unit 430 (FIG. 13) instead of the representative value generation unit 30 of signal separation device 1 of the first embodiment (FIG. 1), and is provided with a limited signal generation unit 450-k (FIG. 13) instead of the limited signal generation unit 50-k of signal separation device 1 (FIG. 1). The other aspects of the configuration are the same as in the first embodiment.

FIG. 14 shows a flowchart that illustrates the signal separation process in this embodiment. In the following, the signal separation process of this embodiment is described with reference to this flowchart.

First, as a preliminary process, the time-domain observed signals x_(j)(t) (=1, . . . , M) observed by each sensor are stored in memory unit 2 (FIG. 1). Then, when the signal separation process is started, signal separation processor 3 performs the following processing under the control of control unit 10.

First, signal separation processor 3 accesses memory unit 2 under the control of control unit 10 and sequentially reads out each of the observed signal values x_(j)(t), which it sends to frequency domain transformation unit 20 (Step S21). Frequency domain transformation unit 20 uses a transformation such as a short time discrete Fourier transform to transform these signal values into a series of frequency-domain observed signal values X_(j)(f,m) for each time interval, which it stores in temporary memory unit 90 (Step S22).

Next, clustering unit 432 (FIG. 13) reads out the frequency-domain observed signal values X₁(f,m), . . . , X_(M)(f,m) stored in temporary memory unit 90 (FIG. 1). Clustering unit 432 (FIG. 13) then clusters the observed signal vectors X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)] (called the “first vectors”) consisting of the frequency-domain signal values X_(j)(f,m), . . . , X_(M)(f,m) into N clusters each C_(i)(f) (i=1, . . . , N), and generates N clusters C_(i) (i=1,2, . . . , N) equal to the number of signal sources N (Step S23). These N clusters C_(i) are stored in temporary memory unit 90 (FIG. 1).

In this embodiment a cluster is a set of observed signal vectors X(f,m), and is expressed using the set T_(i) of discrete time intervals in the form C_(i)(f)={X(f,m)|m∈T_(i)}. Also, the aim of clustering is to classify samples (observed signal vectors X(f,m)) in which the same signal source is predominant (i.e., a main component) into the same cluster. Note that the resulting N clusters C₁(f), . . . , C_(N)(f) do not necessarily need to be disjoint (C_(i)(f)∩C_(j)(f)=Ø; i≠j), and there may be some elements that do not belong to any cluster:

FORMULA  29 ${X\left( {f,m} \right)} \notin {\underset{i = 1}{\bigcup\limits^{N}}C_{i}}$

Detailed Description of the Processing in Clustering Unit 432

The processing performed by clustering unit 432 is described in greater detail here.

The clustering unit 432 of this example performs clustering after normalizing each sample so that clustering can be suitably achieved—i.e., so that samples (observed signal vectors X(f,m)) in which the same signal source is dominant are classified into the same clusters.

For example a normalization unit 432 a (FIG. 13) could read in the observed signal vectors X(f,m) from temporary memory unit 90 (FIG. 1), perform the following calculation:

$\quad\begin{matrix} {{{FORMULA}\mspace{14mu} 30}{{{sign}\left( {X_{j}\left( {f,m} \right)} \right)} = \left\{ \begin{matrix} {{X_{j}\left( {f,m} \right)}/{{X_{j}\left( {f,m} \right)}}} & \left( {{{X_{j}\left( {f,m} \right)}} \neq 0} \right) \\ 0 & \left( {{{X_{j}\left( {f,m} \right)}} = 0} \right) \end{matrix} \right.}} & (28) \end{matrix}$ and normalize it as follows:

$\begin{matrix} \left. {X\left( {f,m} \right)}\leftarrow\left\{ \begin{matrix} {{X\left( {f,m} \right)}/{{sign}\left( {X_{j}\left( {f,m} \right)} \right)}} & \left( {{{X_{j}\left( {f,m} \right)}} \neq 0} \right) \\ {X\left( {f,m} \right)} & \left( {{{X_{j}\left( {f,m} \right)}} = 0} \right) \end{matrix} \right. \right. & (29) \end{matrix}$ and then a cluster generation unit 432 b could cluster the results of this normalization.

If it is also necessary, the normalization unit 432 a of this example follows the normalization of Formula (28) and Formula (29) with additional normalization as follows:

$\quad\begin{matrix} {{{FORMULA}\mspace{14mu} 31}\left. {X\left( {f,m} \right)}\leftarrow\left\{ \begin{matrix} {{X\left( {f,m} \right)}/{{X\left( {f,m} \right)}}} & \left( {{{X\left( {f,m} \right)}\left. {\neq 0} \right)}} \right. \\ {X\left( {f,m} \right)} & \left( {{{X\left( {f,m} \right)}\left. {= 0} \right)}} \right. \end{matrix} \right. \right.} & (30) \end{matrix}$ and cluster generation unit 432 b performs clustering on the results of this normalization. Here, the vector length ∥X(f,m)∥ is the norm of X(f,m), which can, for example, be obtained from the L₂ norm ∥X(f,m)∥=L₂(X(f,m)) defined as follows:

$\begin{matrix} {\text{FORMULA~~}32} & \; \\ {{L_{k}\left( {X\left( {f,m} \right)} \right)} = \left( {\underset{j = 1}{\sum\limits^{M}}{{X_{j}}^{k}\left( {f,m} \right)}} \right)^{1/k}} & (31) \end{matrix}$

Also, as the clustering method performed by cluster generation unit 432 b, it is possible to use a method described in many textbooks, such as hierarchical clustering or k-means clustering (see, e.g., Richard O. Duda, “Pattern Classification (2^(nd) ed.)”, John Wiley & Sons, Inc., ISBN 0-471-05669-3, chapter 10). Note that in any clustering method, the distance between two samples X(f,m) and X′(f,m) is defined as a means of measuring the proximity between samples, and clustering is performed so that every effort is made to include samples that are close to each other in the same clusters.

For example, when the samples are normalized only by Formula (29) above, cluster generation unit 432 b performs clustering using the cosine distance between two normalized observed signal vectors X(f,m) as a measure of the distance between them. The cosine distance between two samples X(f,m) and X′(f,m) is defined as follows: 1−X ^(H)(f,m)·X′(f,m)/(∥X(f,m)∥·∥X′(f,m)∥)  (32)

Also, when the samples have been normalized according to the abovementioned Formula (29) and Formula (30), cluster generation unit 432 b performs clustering using the L₂ norm ∥X(f,m)−X′(f,m)=L₂(X(f,m)−X′(f,m)) of the difference between two normalized observed signal vectors X(f,m)−X′(f,m), or an L_(k) norm with any value of k, or the cosinedistance (Formula (32)) as a measure of the distance ends the [Detailed description of the processing in clustering unit 432].)

Next, representative value calculation unit 433 sequentially extracts each cluster C_(i)(f) stored in temporary memory unit 90 (FIG. 1), and calculates a representative vectors (we call it to the “second vectors”) a_(i)(f) to represent each cluster C_(i)(f) (Step S24).

Detailed Description of the Processing in Representative Value Calculation Unit 433

For example, representative vector generation unit 433 a of representative value calculation unit 433 (FIG. 13) first sequentially extracts each class C_(i)(f) stored in temporary memory unit 90 (FIG. 1), and calculates the mean of the sample values X(f,m) belonging to each cluster C_(i)(f)

FORMULA  33 ${a_{i}(f)} = {\sum\limits_{{X{({f,m})}} \in {C_{i}{(f)}}}{{X\left( {f,m} \right)}/{{C_{i}(f)}}}}$ as a representative vector a_(i)(f) relating to each signal source. Alternatively, the samples X(f,m) belonging to each cluster C_(i)(f) may be suitably quantized and the most frequent values chosen as the representative vectors a_(i)(f). The representative vectors a_(i)(f) obtained in this way are stored in temporary memory unit 90 (FIG. 1).

Next, a sorting unit 433 b (FIG. 13) reads out these representative vectors a₁(f), . . . , a_(N)(f) from temporary memory unit 90 (FIG. 1) and reassigns the subscript i of each representative vector a_(i)(f) so that the correspondence between these representative vectors a₁(f), . . . , a_(N)(f) and each source signal S_(k)(t) becomes the same at all frequencies f (Step S25).

For example, sorting unit 433 b (FIG. 13) might perform the following calculation using the representative vector a_(i)(f) for each frequency f:

$\quad\begin{matrix} {{{FORMULA}\mspace{14mu} 34}{{\theta_{i}(f)} = {\arccos\frac{\text{arg}\left( {{a_{ji}(f)}/{a_{j^{\prime}i}(f)}} \right)}{2\pi\; f\; v_{e}^{- 1}{{d_{j} - d_{j^{\prime}}}}}}}} & (34) \end{matrix}$ to calculate the estimated value θ_(i)(f) of the arrival direction of source signal i at each frequency f. Here, d_(j) is the position of sensorj, v_(e) is the velocity of the signal, and a_(ji)(f) is the i-th element of representative vector a_(j)(f)—for the values of d_(j) and v_(e), it is assumed that data pre-stored in temporary memory unit 90 is used, for example.

The estimated values θ_(i)(f) calculated in this way are, for example, stored in temporary memory unit 90 (FIG. 1) after associating them with the representative vector a_(i)(f) used to calculate them. Next, sorting unit 433 b (FIG. 13), for example, reads in each estimated value θ_(i)(f) from temporary memory unit 90, and sorts them into a prescribed ordering (e.g., ascending or descending order) for each frequency f. This sorting could, for example, be performed using a known sorting algorithm. The information representing the order of the sorted representative vectors at each frequency f (j′(f,a_(i)(f))=1, 2, . . . , N) is then stored in temporary memory unit 90 (FIG. 1). Next, sorting unit 433 b (FIG. 13) reads in this ordering information j′(f,a_(i)(f)) from temporary memory unit 90, for example, and changes the correspondence between the representative vectors and the indices i (i.e., it reassigns the subscripts i of a_(i)(f)) so that each values of a_(i)(f) is made to correspond to the j′(f,a_(i)(f))-th source signal. These representative vectors a_(i)(f) with reassigned subscripts i are then stored in temporary memory unit 90 (FIG. 1).

Next, mask control unit 40 substitutes the data specifying a set G₀ whose elements are these representative vectors a_(i)(f) into a variable SG₀, and stores this variable SG₀ in temporary memory unit 90. Mask control unit 40 also initializes a variable SG specifying a set G to G=Ø (empty set) and sets a variable k to zero, and stores them in temporary memory unit 90 (Step S26).

Next, under the control of mask control unit 40, processing is performed by a plurality of systems (u systems) comprising limited signal generation unit 50-k (k=1, . . . , u), limited signal separation unit 60-k and time domain transformation unit 70-k until all N separated signals have been obtained.

First, mask control unit 40 adds 1 to the value of variable k stored in temporary memory unit 90 to obtain a new value for variable k which is stored back in temporary memory unit 90 (Step S27).

Next, mask control unit 40 retrieves the variables SG₀ and SG from temporary memory unit 90 (FIG. 1). Then, in mask control unit 40, a set G_(k) consisting of V (≦M) suitable representative vectors a_(p)(f) (p=1, . . . , V) (called the “third vectors”) including the members of the complementary set G^(c) of the set G specified by SG (the notation α^(c) represents the complementary set of α), the data specifying this set G_(k) is assigned to variable SG_(k) is selected from the set G₀ specified by variable SG₀, and this variable SG_(k) is stored in temporary memory unit 90 (Step S28). That is, mask control unit 40 extracts V representative vectors a_(p)(f) (p=1, . . . , V) corresponding to the V signals extracted as limited signals from each representative vector a₁(f), . . . , a_(N)(f).

In this embodiment, sample values X(f,m) that are close to the representative vectors a_(p)(f) included in this set G_(k) are extracted, and sample values X(f,m) that are close to representative vectors not included in this set G_(k) (i.e., the elements of set G_(k) ^(c), where *^(c) is the complementary set of *) are not extracted, thereby producing a limited signal X^(f,m) consisting of a mixture of V signals.

For this purpose, in this embodiment the mask generation unit 451-k of limited signal generation unit 450-k (FIG. 13) reads in the variables SG_(k) and SG₀ and the observed signal vector X(f,m) from temporary memory unit 90 (FIG. 1) and generates the following mask M_(k)(f,m) (Step S29):

FORMULA  35 ${M_{k}\left( {f,m} \right)} = \left\{ \begin{matrix} 1 & {{\max_{{a_{p}{(f)}}{\varepsilon G}_{k}}{D\left( {{X\left( {f,m} \right)},{a_{p}(f)}} \right)}} < {\min_{{a_{q}{(f)}}{\varepsilon G}_{k}^{c}}{D\left( {{X\left( {f,m} \right)},{a_{q}(f)}} \right)}}} \\ 0 & \text{otherwise} \end{matrix} \right.$ Here, D(X(f,m),a_(i)(f)) represents the Mahanalobis square distance between vector X(f,m) and a_(i)(f): D(X(f,m)a _(i)(f))=(X(f,m)−a _(i)(f))^(H)Σ⁻¹(X(f,m)−a _(i)(f) Σ represents the covariance matrix of cluster C_(i):

$\sum{= {\frac{1}{C_{i}}\;{\sum{\left( {{X\left( {f,m} \right)} - {a_{i}(f)}} \right)\left( {{X\left( {f,m} \right)} - {a_{i}(f)}} \right)^{H}}}}}$ and |C_(i)| represents the number of samples that belong to cluster C_(i). Alternatively, when it is known that the magnitudes of the source signals are more or less the same, a covariance matrix of Σ=I (identity matrix) may be used.

This mask M_(k)(f,m) is stored in temporary memory unit 90 (FIG. 1), and then limited signal extraction unit 452-k (FIG. 13) reads in mask M_(k)(f,m) and observed signal vector X(f,m) from temporary memory unit 90, calculates the product of mask M_(k)(f,m) and observed signal vector X(f,m): X _(k)^(f,m)=M _(k)(f,m)·X(f,m) and extracts the limited signal values X_(k)^(f,m) emitted from V signal sources (Step S30).

These limited signal values X_(k)^(f,m) are stored in temporary memory unit 90 (FIG. 1) and are then sent to limited signal separation unit 60-k, which uses these limited signal values X_(k)^(f,m) to perform signal separation on the limited signals (Step S31). Here, the limited signal values X_(k)^(f,m) are treated as approximations to the values of mixed signals consisting of the signals emitted from V (1≦V≦M) signal sources. A separation matrix for these signals can therefore be estimated using the independent component analysis method described in [Conventional method 1]. Specifically, separation can be performed using Formula (2) mentioned in [Conventional method 1], for example, using limited signal values X_(k)^(f,m) as the independent component analysis inputs instead of the observed signal values X. Note that when V=1, the processing of Step 31 is not necessary.

To perform the ICA separation in this embodiment, the limited signal values X_(k)^(f,m) are first used to generate a separation matrix W(f,m) in ICA separation matrix estimation unit 61-k according to the abovementioned learning rule of Formula (2), and this separation matrix W(f,m) is stored in temporary memory unit 90. This separation matrix W(f,m) is for example generated using feedback from the output values Y_(k)(f,m) from permutation/scaling resolution unit 62-k, which is described below. The resulting separation matrix W(f,m) is sent to permutation/scaling resolution unit 62-k. Permutation/scaling resolution unit 62-k uses this separation matrix W(f,m) and the limited signal values X_(k)(f,m) to generate the respective separated signal values Y_(k)(f,m)=[Y_(k1) ^(Πk1)(f,m), . . . , Y_(kV) ^(ΠkV)(f,m)]^(T) by performing the calculation Y_(k)(f,m)=W(f,m)X_(k)^(f,m), and stores them in temporary memory unit 90. Permutation/scaling resolution unit 62-k then, for example, feeds back these separated signal values Y_(k)(f,m) to resolve the permutation problem with the method mentioned in [Conventional method 1]. After resolving the permutation problem, permutation/scaling resolution unit 62-k then applies tags Π_(kq) to the separated signal values Y_(kq) (q=1, . . . , V) to show which source signal the separated signal values Y_(kq) (q=1, . . . , V) correspond to, and these are stored together in temporary memory unit 90. Here, these tags Π_(kq) are represented by adding the superscript Π_(kq) to the separated signal values Y_(kq).

For example permutation/scaling resolution unit 62-k could compare the estimated arrival direction θ_(q)(f) of the signals, which are obtained using the inverse matrix of separation matrix W(f) extracted from temporary memory unit 90 (or the Moore-Penrose pseudo-inverse matrix when N≠M) by the following formula:

$\quad\begin{matrix} {{{FORMULA}\mspace{14mu} 36}{{\theta_{q}(f)} = {\arccos\frac{\text{arg}\left( {\left\lbrack {W_{jq}^{- 1}(f)} \right\rbrack/\left\lbrack {W_{j^{\prime}q}^{- 1}(f)} \right\rbrack} \right)}{2\pi\; f\; v_{e}^{- 1}{{d_{j} - d_{j^{\prime}}}}}}}} & (36) \end{matrix}$ (where v_(e) the signal velocity and d_(j) is the position of sensor j) with the representative vector a_(p)(f) included in set G_(k) indicating the variables SG_(k) extracted from temporary memory unit 90, and could associate the representative vector a_(p)(f) closest to θ_(q) with the q-th separated signal Y_(kq) (Step S32). In other words, permutation/scaling resolution unit 62-k applies tags Π_(kq) representing the representative values a_(i) to the separated signals Y_(kq) (in other words associating the tags Π_(kq) with the separated signals Y_(kq)).

After that, permutation/scaling resolution unit 62-k extracts the separation matrix W(f) from temporary memory unit 90 and resolves the ICA scaling problem by updating each row w_(q)(f) thereof as follows: w _(q)(f)←[W ⁻¹(f)]_(jq) w _(q)(f) and then stores the updated separation matrix W(f) in temporary memory unit 90. For the subsequent processing in signal combination unit 80, it is desirable that the same value of j is used for the entire series k in this process.

The separated signal values Y_(kq) appended tags Π_(kq) are sent to time domain transformation unit 70-k. Time domain transformation unit 70-k uses, for example, a short time inverse discrete Fourier transform or the like to transform each of the separated signal values Y_(kq) (which are obtained in the time-frequency domain) into time-domain signal values, and stores these transformed values in temporary memory unit 90 (Step S33). Note that these time-domain signal values y_(k)(t)=[y_(k1) ^(Πk1)(t), . . . , y_(kV) ^(ΠkV)(t)]^(T) are also associated with the abovementioned tags Π_(kq). When these associations are made, time domain transformation unit 70-k first extracts the tags Π_(kq) associated with the frequency-domain signal values Y_(kq) from temporary memory unit 90 for each frequency and time interval. Next, time domain transformation unit 70-k judges whether or not the tags Π_(kq) at each frequency and time interval are all the same. If they are all the same, the time-domain signal values y_(kq) are tagged by associating them with the tags Π_(kq) applied to the frequency-domain signal values Y_(kq). On the other hand, if they are not all the same then the tags of the time-domain signal values y_(kq) are determined based on a majority decision.

Next, in mask control unit 40, the variables SG and SG_(k) are extracted from temporary memory unit 90, and the union set G^(∪)G_(k) of the sets G and G_(k) represented by these variables is taken as a new set G; this set G is substituted into variable SG, and this variable SG is stored in temporary memory unit 90 (Step S34). Also, mask control unit 40 reads out variables SG and SG₀ from temporary memory unit 90, and judges whether or not this new set G is equal to set G₀ (Step S35). Here, unless G=G₀, the processing returns to Step S27.

On the other hand, if G=G₀, then in signal combination unit 80, the separated signals y_(kp)(t) output from each system k (time domain transformation unit 70-k; k=1, . . . , u) are read out from temporary memory unit 90, and these are selected and combined to yield all N separated signals (Step S36). For example, signal combination unit 80 might first compare the tags Π_(kq) of each separated signal y_(kp)(t) read out from temporary memory unit 90. Here, when it is judged that there are no separated signal values y_(kp)(t) that have the same tag in a plurality of systems k, signal combination unit 80 outputs all the separated signal values y_(kq)(t) as the final separated signal values y_(i)(t) (i=1, . . . , N) (Step S37). On the other hand, when it is judged that there are separated signal values having the same tag in a plurality of systems, signal combination unit 80 either appropriately selects one of these separated signal values with the same tag and outputs it as a final separated signal value y_(i)(t), or calculates the mean of the separated signal values with the same tag and uses this mean value as the output signal (Step S37).

Here, in the process whereby one of the separated signal values y_(kq)(t) is appropriately selected and output as the final separated signal value y_(i)(t), signal combination unit 80 could, for example, determine which of the separated signal values y_(kq)(t) having the same tag a_(i) contains the greatest power, and output it as the final separated signal value y_(i)(t). Also, in the process whereby the mean of the separated signal values having the same tag is output as the final separated signal value y_(i)(t), signal combination unit 80 could, for example, use the following formula:

FORMULA  37 ${y_{i}(t)} = {\frac{1}{K}{\sum_{\Pi_{{kq} = a_{i}}}{y_{kq}^{\Pi_{kq}}(t)}}}$ (where K is the number of separated signals having the same tag a_(i)) In this way, the N signals are separated with low distortion.

As a variant of this embodiment, the limited signal values could be generated directly from the formula:

Formula  38 ${{\hat{X}}_{k}\left( {f,m} \right)} = \left\{ \begin{matrix} {X\left( {f,m} \right)} & {{\max_{{a_{p}{(f)}}{\varepsilon G}_{k}}{D\left( {{X\left( {f,m} \right)},{a_{p}(f)}} \right)}} < {\min_{{a_{q}{(f)}}{\varepsilon G}_{k}^{c}}{D\left( {{X\left( {f,m} \right)},{a_{q}(f)}} \right)}}} \\ 0 & \text{otherwise} \end{matrix} \right.$ without generating a mask M(f,m).

Ninth Embodiment

This embodiment relates to the third present invention.

Configuration

FIG. 15 is a block diagram showing an example of the configuration of a signal separation device 500 according to this embodiment. The arrows in this figure indicate the flow of data, but the flow of data into and out from control unit 521 and temporary memory unit 522 is not shown. Specifically, even when data passes through control unit 521 or temporary memory unit 522, the associated process is not shown.

The configuration of this embodiment is described first with reference to this figure.

As shown in the example in FIG. 15, the signal separation device 500 of this embodiment includes a memory unit 501 and a signal separation processor 502 that is electrically connected thereto by a hard-wired or wireless connection.

Memory unit 501 might be, for example, a hard disk device, a magnetic recording device such as a flexible disk or magnetic tape device, an optical disk device such as a DVD-RAM (random access memory) or CD-R (recordable)/RW (rewritable) device, a magneto-optical recording device such as an MO (magneto-optical) disc device, or a semiconductor memory such as an EEPROM (electronically erasable programmable read-only memory) or flash memory. Memory unit 501 may be situated inside the same enclosure as signal separation processor 502, or it may be housed separately.

This signal separation processor 502 consists of hardware configured from elements such as a processor and RAM, for example, and it also incorporates a frequency domain transformation unit 511, a mixing matrix estimation unit 512, a permutation problem resolution unit 513, a scaling problem resolution unit 514, a column selection unit 516, a matrix generation unit 517, a separation matrix generation unit 518, a separated signal generation unit 519, a time domain transformation unit 520, a control unit 521, and a temporary memory unit 522. Also, the mixing matrix estimation unit 512 of this example incorporates a clustering unit 512 a, a representative vector calculation unit 512 b, and a vector combination unit 512 c. Furthermore, clustering unit 512 a incorporates a normalization unit 512 aa and a cluster generation unit 512 ab.

Processing

FIG. 16 is a flowchart illustrating the overall processing that takes place in signal separation device 500 in this embodiment. In the following, the processing of signal separation device 500 is described with reference to FIG. 15 and FIG. 16. Note that the following description relates to situations where signals emitted from N (N≧2) signal sources are mixed together and observed with M sensors.

Overall Processing

Under the control of control unit 521, signal separation device 500 performs the following processing.

First, the observed signal values x₁(t), . . . , x_(M)(t) (where t is time) observed by the M sensors are read in from memory unit 501 and input to frequency domain transformation unit 511 (FIG. 15). Frequency domain transformation unit 511 uses a transformation such as a short time discrete Fourier transform to transform these observed signal values x₁(t), . . . , x_(M)(t) into frequency-domain observed signal values X₁(f,m), . . . , X_(M)(f,m) (where m is the discrete time interval) (Step S51). These frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m) are stored in temporary memory unit 522, and are read in by clustering unit 512 a of mixing matrix estimation unit 512. Clustering unit 512 a clusters the resulting observed signal vectors X(,fm)=[X₁(f,m), . . . , X_(M)(f,m)]^(T) into N clusters C_(i)(f) (i=1, . . . , N) for each frequency f (Step S52). Each cluster C_(i)(f) is sent to representative vector calculation unit 512 b, and representative vector calculation unit 512 b calculates a representative vector a_(i)(f) for each cluster C_(i)(f) (Step S53). Each representative vector a_(i)(f) is stored in temporary memory unit 522, and is then sequentially read out by vector combination unit 512 c which generates an estimated mixing matrix A(f)=[a₁(f), . . . , a_(N)(f)] whose columns are the representative vectors a_(i)(f) (Step S54). The resulting estimated mixing matrix A(f) is stored in temporary memory unit 522.

Permutation problem resolution unit 513 reads in the estimated mixing matrix A(f) from temporary memory unit 522, and resolves the permutation problem by sorting the columns of estimated mixing matrix A(f) (Step S55). In this process it is possible to employ feedback of the separated signal values Y₁(f,m), . . . , Y_(N)(f,m) as described below, in which case the permutation problem can be resolved more accurately.

Next, after the scaling problem has been resolved by normalizing the columns of the estimated mixing matrix A(f) in scaling problem resolution unit 514 (Step S56), this estimated mixing matrix A(f) is used by separation matrix generation unit 518 to generate a separation matrix W(f,m) (Step S57). The resulting separation matrix W(f,m) is stored in temporary memory unit 522, from where it is then sent to separated signal generation unit 519, which reads in the frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m) from temporary memory unit 522, and calculates the separated signal vectors Y(f,m)=[Y₁(f,m), . . . , Y_(N)(f,m)]^(T) by performing the calculation Y(f,m)=W(f,m)X(f,m) (Step S58). The calculated separated signal values Y₁(f,m), . . . , Y_(N)(f,m) are stored in temporary memory unit 522 and fed back to permutation problem resolution unit 513, and are also sent to time domain transformation unit 520. Time domain transformation unit 520 then transforms the separated signal values Y₁(f,m), . . . , Y_(N)(f,m) into time-domain signals y₁(t), . . . , y_(N)(t) by performing a short time inverse Fourier transform or the like for each subscript i (Step S59), thereby yielding the time-domain separated signal values y_(i)(t).

Detailed Description of the Processing in Mixing Matrix Estimation Unit 512

Next, the processing performed in mixing matrix estimation unit 512 is described in detail. Note that the following processing is applied to each frequency.

First, clustering unit 512 a collects together the observed signal components X₁(f,m), . . . , X_(M)(f,m) of all the sensors read in from temporary memory unit 522, and associates them together as an observed signal vector X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)]^(T). Clustering unit 512 a then performs clustering to generate N clusters C_(i)(f) equal in number to the number of signal sources, and stores them in temporary memory unit 522 (Step S52).

Here, a cluster is a set of observed signal vectors X(f,m), and is expressed using the set T_(i) of discrete time intervals in the form C_(i)(f)={X(f,m)|m∈T_(i)}. Also, the aim of clustering is to classify samples (observed signal vectors X(f,m)) in which the same signal source is predominant (having the main component) into the same cluster. The resulting N clusters C₁(f), . . . , C_(N)(f) do not necessarily need to be mutually prime (C_(i)(f)∩C_(j)(f)=Ø, i≠j), and there may be some elements that do not belong to any cluster:

FORMULA  40 ${X\left( {f,m} \right)} \notin {\underset{i = 1}{\bigcup\limits^{N}}C_{i}}$

Next, representative vector calculation unit 512 b reads in each cluster C_(i)(f) from temporary memory unit 522, and calculates the mean of the samples X(f,m) belonging to each cluster C_(i)(f):

FORMULA  41 ${a_{i}(m)} = {\sum\limits_{{X{({f,m})}} \in {C_{i}{(f)}}}{{X\left( {f,m} \right)}/{{C_{i}(f)}}}}$ as a representative vector a_(i)(f) for each signal source (Step S53). Alternatively, the samples X(f,m) belonging to each cluster C_(i)(f) may be suitably quantized and the most frequent values chosen as the representative vectors a_(i)(f).

Finally, the N representative vectors are collected together in vector combination unit 12 c, which generates and outputs an estimated mixing matrix A(f)=[a₁(f), . . . , a_(N)(f)] which is an estimated matrix of the mixing matrix H(f)=[h₁(f), . . . , h_(N)(f)] (Step S54). The estimated mixing matrix A(f) is indeterminate with regard to the ordering of each vector (permutation indeterminacy) and indeterminate with regard to the magnitude of each vector (scaling indeterminacy). In other words, a representative vector a_(i)(f) is estimated as a vector which is h_(Π(i))(f) multiplied by a complex number. Here, Π is a permutation representing the permutation indeterminacy.

Detailed Description of the Processing in Clustering Unit 512 a

Next, the processing performed in clustering unit 512 a is described in more detail.

The clustering unit 512 a in this example performs clustering after each sample has been normalized in normalization unit 512 aa so that clustering can be suitably achieved—i.e., so that samples (observed signal vectors X(f,m)) in which the same signal source is dominant are classified into the same clusters.

Specifically, the normalization unit 512 aa of this example performs the following calculation:

$\begin{matrix} {{{FORMULA}\mspace{14mu} 42}{{{sign}\left( {X_{j}\left( {f,m} \right)} \right)} = \left\{ \begin{matrix} {{X_{j}\left( {f,m} \right)}/{{X_{j}\left( {f,m} \right)}}} & \left( {{{X_{j}\left( {f,m} \right)}} \neq 0} \right) \\ 0 & \left( {{{X_{j}\left( {f,m} \right)}} = 0} \right) \end{matrix} \right.}} & (35) \end{matrix}$ and normalizes it as follows:

$\begin{matrix} \left. {X\left( {f,m} \right)}\leftarrow\left\{ \begin{matrix} {{X\left( {f,m} \right)}/{{sign}\left( {X_{j}\left( {f,m} \right)} \right)}} & \left( {{{X_{j}\left( {f,m} \right)}} \neq 0} \right) \\ {X\left( {f,m} \right)} & \left( {{{X_{j}\left( {f,m} \right)}} = 0} \right) \end{matrix} \right. \right. & (36) \end{matrix}$ before performing clustering.

If it is also necessary, the normalization unit 512 aa of this example may perform clustering after performing additional normalization as follows:

$\begin{matrix} {{{FORMULA}\mspace{14mu} 43}\left. {X\left( {f,m} \right)}\leftarrow\left\{ \begin{matrix} {{X\left( {f,m} \right)}/{\left( {X\left( {f,m} \right)} \right.}} & \left( {{{X\left( {f,m} \right)}} \neq 0} \right) \\ {X\left( {f,m} \right)} & \left( {{{X\left( {f,m} \right)}} = 0} \right) \end{matrix} \right. \right.} & (37) \end{matrix}$ Here, the vector length ∥X(f,m)∥ is the norm of X(f,m), which can, for example, be obtained from the L₂ norm ∥X(f,m)∥=L₂(X(f,m)) defined as follows:

$\begin{matrix} {\text{FORMULA~~}44} & \; \\ {{L_{k}\left( {X\left( {f,m} \right)} \right)} = \left( {\underset{j = 1}{\sum\limits^{M}}{{X_{j}}^{k}\left( {f,m} \right)}} \right)^{1/k}} & (38) \end{matrix}$

Also, as the clustering method, it is possible to use a method described in many textbooks, such as hierarchical clustering or k means clustering (see, e.g., Richard O. Duda, “Pattern Classification (2^(nd) ed.),” John Wiley & Sons, Inc., ISBN 0-471-05669-3, chapter 10). Note that in any clustering method, the distance between two samples X(f,m) and X′(f,m) is defined as a means of measuring the proximity between samples, and clustering is performed so that every effort is made to include samples that are close to each other in the same clusters.

For example, when the samples are normalized only by Formula (36) above, clustering unit 512 a performs clustering using the cosine distance between two normalized observed signal vectors X(f,m) as a measure of the distance between them. The cosine distance between two samples X(f,m) and X′(f,m) is defined as follows: 1−X ^(H)(f,m)·X′(f,m)/(∥X(f,m)∥·∥X′(f,m)∥)  (39)

When the samples have been normalized according to the abovementioned Formula (36) and Formula (37), clustering unit 512 a performs clustering in cluster generation unit 512 ab using the L₂ norm ∥X(f,m)−X′(f,m)∥=L₂(X(f,m)−X′(f,m)) of the difference between two normalized observed signal vectors X(f,m)−X′(f,m), or an L_(k) norm with any value of k, or the cosine distance (Formula (39)) as a measure of the distance between them.

The reason why the above operations result in the representative vector a_(i)(f) of each cluster C_(i) becoming an estimate of the mixing vector h_(k)(f) (including magnitude indeterminacy) is explained below.

A cluster C_(i) contains a collection of observed signal vectors X(f,m) in which only a certain source signal S_(k) is predominant and the other source signals are close to zero. This state can be approximated as follows: X(f,m)=h _(k)(f)S_(k)(f,m)  (40)

Normalizing this function by Formula (36) yields the following: X←X/sign(X _(j))=h _(k) S _(k)/sign(H _(jk) S _(k))=sign*(H _(jk))|S _(k) |h _(k)  (41) This involves using the relationships sign (H_(jk)S_(k))=sign(H_(jk)) sign(S_(k)), 1/sign(H_(jk))=sign(H_(jk)) (where * is a complex conjugate operator), and S_(k)/sign(S_(k))=|S_(k)|. Also, the parameters f and m have been omitted from these formulae.

Normalizing by Formula (37) and applying Formula (40) yields the following: X←X/∥X∥=sign*(H _(jk))|S _(k) |h _(k)/(|S _(k) |·∥h _(k)∥)=sign*(H _(jk))h _(k) /∥h _(k)∥  (42) Here, the relationship ∥sign*(H_(jk))|S_(k)|h_(k)∥=|S_(k)|·∥h_(k)∥ is used. The paramet and m have also been omitted from these formulae.

From Formula (41), it can be seen that the observed signal vectors X(f,m) normalized by Formula (36) will collect together on a straight line corresponding to the mixing vector h_(k)(f) multiplied by sign*(H_(jk)(f)). The position of each vector on this straight line depends on the magnitude |S_(k)(f,m)| of the signal source. Also, from Formula (42), it can be seen that the observed signal vectors X(f,m) normalized by formula (37) will collect together at a single point sign*(H_(jk)(f))h_(k)(f)/∥h_(k)(f)∥ in complex space. This shows that the representative vectors a_(i)(f) calculated as the mean of the normalized observed signal vectors X(f,m) constitutes an estimate of the mixing vector h_(k)(f) including the magnitude indeterminacy.

Detailed Description of the Processing in Permutation Problem Resolution Unit 513

Next, the processing performed in permutation problem resolution unit 513 is described in detail.

In permutation problem resolution unit 513, the columns of the estimated mixing matrix A(f) calculated at each frequency f are sorted so that the representative vectors a_(i)(f) relating to the same signal source s_(k)(t) are the same at all frequencies f (Step S55). Specifically, the subscripts i are reassigned so that the correspondence between each separated signal Y₁(f,m), . . . , Y_(N)(f,m) and each signal source becomes the same at all frequencies f. For this purpose it is possible to use, for example, two types of information based on the procedure of Non-Patent Reference 2, as in the prior art.

The first type of information is positional information such as the signal source arrival directions or the like. In methods that use conventional ICA, the separation matrix W is obtained by ICA, and positional information has been obtained from the Moore-Penrose pseudo-inverse matrix W⁺ (which corresponds to the inverse matrix W⁻¹ when M=N) of this matrix. Here, the Moore-Penrose pseudo-inverse matrix W⁺ is regarded as an estimate of the mixing matrix A(f). Consequently, in this embodiment, unlike conventional methods where ICA is used, the estimated mixing matrix A(f) is itself regarded as a Moore-Penrose pseudo-inverse matrix W⁺, and the positional information can be obtained directly from each column of this matrix. Specifically, the positional information can be obtained from the following formula, for example:

$\begin{matrix} {{FORMULA}\mspace{14mu} 45} & \; \\ {\theta_{i} = {\cos^{- 1}\frac{{angle}\left( {{A_{ji}(f)}/{A_{j^{\prime}i}(f)}} \right)}{2\pi\;{fv}_{v_{e}}^{- 1}{{d_{j} - d_{j^{\prime}}}}}}} & (45) \end{matrix}$ Here, θ_(i) is the angle between the straight line connecting sensor j and sensor j′ and the straight line from the mid point between sensor j and sensor j′ to the location of signal source i. Also, d_(j) is a vector representing the position of sensor j. To resolve the permutation problem, the columns of the estimated mixing matrix A(f) are sorted so that the correspondence between each subscript i and each value of θ_(i) becomes the same at each frequency, for example.

The second type of information is the correlation between frequencies of the absolute values |Y_(i)(f,m)| of the separated signal components, as used in conventional ICA methods. Specifically, the permutation problem is resolved by, for example, sorting the columns of estimated mixing matrix A(f) so as to maximize the correlation between the absolute values of the separated signal components for the same subscript i at different frequencies f1and f2:

$\begin{matrix} {{FORMULA}\mspace{14mu} 46} & \; \\ {{{cor}\left( {v_{i}^{f1},v_{i}^{f2}} \right)} = \frac{\left\langle {{v_{i}^{f1}(m)} \cdot {v_{i}^{f2}(m)}} \right\rangle_{m}}{\sqrt{\left\langle {v_{i}^{f1}(m)} \right\rangle_{m}} \cdot \sqrt{\left\langle {v_{i}^{f2}(m)} \right\rangle_{m}}}} & (44) \end{matrix}$ (Here, v_(i) ^(f)(m)=|Y_(i)(f,m)−<|Y_(i)(f,m)|>_(m), and the notation <•>_(m) represents the mean of “•” with respect to time m.)

The separated signals used in this process are obtained by feeding back the outputs Y₁(f,m), . . . , Y_(N)(f,m) of separated signal generation unit 519.

Detailed Description of the Processing in Scaling Problem Resolution Unit 514

Next, the processing performed in scaling problem resolution unit 514 is described in detail.

Scaling problem resolution unit 514 receives the estimated mixing matrix A(f) from permutation problem resolution unit 513, and in order to resolve the indeterminacy in the magnitude of each column, it first normalizes each column (representative vector) a_(i)(f) of the estimated mixing matrix A(f) as follows (Step S56): a _(i)(f)←a _(i)(f)/a _(ji)(f) where a_(ji) is the element in the j-th row of representative vector a_(i)(f). Alternatively, a different j could be chosen for each representative vector a_(i)(f), but it is important to use the same value of j for the same value of i at each frequency f.

Detailed Description of the Separated Signal Generation Process

Next, the separated signal generation process is described in detail.

In this embodiment, the procedure used to generate the separated signals differs depending on whether or not there is a sufficient number of sensors with respect to the number of signal sources.

First, when there is a sufficient number of sensors (M≧N), the separated signals can be generated easily. Specifically, separation matrix generation unit 518 receives the estimated mixing matrix A(f) from scaling problem resolution unit 514, and calculates the Moore-Penrose pseudo-inverse matrix A(f)⁺ (equivalent to the inverse matrix A(f)⁻¹ when M=N) as the separation matrix W(f) (Step S57). The resulting separation matrix W(f) is stored in temporary memory unit 522. Separated signal generation unit 519 reads this separation matrix W(f) and the observed signal vectors X(f,m) from temporary memory unit 522, and uses them to generate the separated signal components Y₁(f,m), . . . , Y_(N)(f,m) by performing the calculation Y(f,m)=W(f)X(f,m) (Step S58).

On the other hand, when the number of sensors is insufficient (M<M), the separated signals Y(f,m) cannot be uniquely determined with respect to the estimated mixing matrix A(f) and observed signal vectors X(f,m). This is because there infinitely many values of Y(f,m) that satisfy the following relationship:

$\begin{matrix} \text{FORMULA~~47} & \; \\ {{X\left( {f,m} \right)} = {{A(f)Y\left( {f,m} \right)} = {\underset{\;{i\; = \; 1}}{\;\sum\limits^{N}}{a_{\; i}(f)}{Y_{\; i}\left( {f,m} \right)}}}} & (47) \end{matrix}$ However, with regard to the sparsity of the source signal, it is known that the most accurate separated signal components are found at solutions of Y(f,m) that minimize the L₁ norm:

$\begin{matrix} {\text{FORMULA~~}48} & \; \\ {{L_{1}\left( {Y\left( {f,m} \right)} \right)} = {\underset{i = 1}{\sum\limits^{N}}{{Y_{i}\left( {f,m} \right)}}}} & (48) \end{matrix}$ (Shun-ichi Amari: “How Can Humans and Machines Distinguish Visual and Auditory Signals? (Introduction)”, Journal of IEICE, Vol. 87, No. 3, p. 167, March 2004). When separation is performed using this sort of minimizing criterion, the separation matrix W(f,m) varies with time so that separation matrix generation unit 518 calculates a time-dependent separation matrix W(f,m) from the observed signal vector X(f,m) and estimated mixing matrix A(f) at each time interval m (Step S57), and separated signal generation unit 519 calculates the separated signal components Y₁(f,m), . . . , Y_(N)(f,m) from the formula Y(f,m)=W(f,m)X(f,m) (Step S58).

However, since the strict minimization of L₁(Y(f,m)) involves a large computational load, the separation matrix W(f,m) is generated using an approximate solution in this embodiment. This solution involves sequentially selecting the columns (representative vectors) a_(i)(f) of estimated mixing matrix A(f) that are oriented closest to the observed signal vectors X(f,m) (or to the residual vector e at a certain point in time), and repeating the process until M selections have been made.

FIG. 17 shows a flowchart illustrating the approximate solution method of this embodiment. The process whereby the separation matrix W(f,m) is calculated using the approximate solution method of this flowchart is described below.

First, column selection unit 516 reads in estimated mixing matrix A(f) and observed signal vector X(f,m) from temporary memory unit 522 (Step S61), initializes residual vector e with the observed signal vector X(f,m), assigns a value of 1 to variable k (Step S62), and stores this information in temporary memory unit 522.

Next, column selection unit 516 checks the value of variable k in temporary memory unit 522, and judges whether or not k≦M (Step S63). If k≦M, column selection unit 516 selects q(k) such that q(k)=argmax_(i) |a _(i)(f)^(H) ·e|/∥a _(i)(f)∥  (47) and stores the result of this selection in temporary memory unit 522 (Step S64). Here, Formula (47) maximizes the absolute value of the dot product of the residual vector e and the length-normalized column |a_(i)(f)^(H)|/∥a_(i)(f)∥—in other words, it represents an operation for selecting the representative vector a_(i)(f) closest to the direction of the residual vector e. The reason for selecting the representative vector a_(i)(f) closest to the direction of the residual vector e is that the residual vector e becomes smaller in the next iteration, and thus each subsequent value of Y_(i)(f,m) becomes smaller so that ultimately it can be expected that the L₁ norm of Y(f,m) defined by Formula (46) also becomes smaller.

Next, column selection unit 516 checks the value of variable k in temporary memory unit 522, and judges whether or not k≦M (Step S63). If k≦M column selection unit 516 selects q(k) such that q(k)=argmax_(i) |a _(i)(f)^(H) ·e|/∥a _(i)(f)∥  (47) and stores the result of this selection in temporary memory unit 522 (Step S64). Here, Formula (47) maximizes the absolute value of the dot product of the residual vector e and the length-normalized column a_(i)(f)^(H)/∥a_(i)(f)∥—in other words, it represents an operation for selecting the representative vector a_(i)(f) closest to the direction of the residual vector e. The reason for selecting the representative vector a_(i)(f) closest to the direction of the residual vector e is that the residual vector e becomes smaller in the next iteration, and thus each subsequent value of Y_(i)(f,m) becomes smaller so that ultimately it can be expected that the L₁ norm of Y(f,m) defined by Formula (46) also becomes smaller.

Here, P·X(f,m) is the projection of observed signal vector X(f,m) in subspace Q—specifically, it is represented by a linear combination of the representative vectors a_(q(1))(f), . . . , a_(q(k))(f) that have so far been selected from the observed signal vectors X(f,m). The remainder e=X(f,m)−P·X(f,m) is represented by the other vectors—specifically, it is represented by the column (representative vector) a_(q(i)) selected in the subsequent loop process.

After that, in order to select the next column in turn, column selection unit 516 produces a new value of k by adding 1 to the variable k in temporary memory unit 522, and returns to step S63 (Step S68). Since the residual vector e only includes components that are orthogonal to the representative vectors a_(q(i)) that have already been selected, there is no possibility of representative vectors that have already been selected being selected again on the basis of maximizing the absolute value of the dot product |a_(i)(f)^(H)·e|/∥a_(i)(f)∥ (Step S64).

Then, at Step S63, when column selection unit 516 judges that k≦M (equivalent to the selection of min(M,N) representative vectors a_(i)(f)), column selection unit 516 ends the loop process of Steps S64-68. At this point, the M selected representative vectors a_(q(i)) Span the full space, so the residual vector e becomes zero. When the loop process of Steps S64-68 ends, matrix generation unit 517 reads these M selected representative vectors a_(q(i)) from temporary memory unit 522, and generates column vectors a_(i)′(f,m) in which the N−M representative vectors (column vectors) a_(i)(f) that were not selected in the processing of steps S63-68 are set to zero (Step S69):

$\begin{matrix} {{FORMULA}\mspace{14mu} 49} & \; \\ {{a_{i}^{\prime}\left( {f,m} \right)} = \left\{ \begin{matrix} {a_{i}(f)} & {i \in \left\{ {{q(1)},\ldots\mspace{11mu},{q(M)}} \right\}} \\ 0 & {i \notin \left\{ {{q(1)},\ldots\mspace{11mu},{q(M)}} \right\}} \end{matrix} \right.} & (49) \end{matrix}$ Furthermore, matrix generation unit 517 calculates a matrix A′(f,m)=[a₁′(f,m), . . . , a_(N)′(f,m)] whose columns are the column vectors a_(i)′(f,m) of Formula (48) and stores it in temporary memory unit 522 (Step S70). The matrix A′(f,m) calculated in this way is an N×M matrix of which N−M rows are zero vectors.

Separation matrix generation unit 518 reads this matrix A′(f,m) from temporary memory unit 522, and generates its Moore-Penrose pseudo-inverse matrix A′(f,m)⁺ as separation matrix W(f,m) (Step S71).

The resulting separation matrix W(f,m) is stored in temporary memory unit 522. Separated signal generation unit 519 reads in this separation matrix W(f,m) and the observed signal vectors X(f,m) from temporary memory unit 522, and uses the formula Y(f,m)=W(f,m)X(f,m) to generate the separated signal components Y₁(f,m), . . . , Y_(N)(f,m), which it stores in temporary memory unit 52 (Step S58). Note that N−M elements of the separated signal components Y₁(f,m), . . . , Y_(N)(f,m) generated in this way will inevitably be zero. That is, by performing the processing of Steps S61-S71 for a certain discrete time interval m, it is only possible to ascertain a maximum of M separated signal components. Consequently, in this embodiment the abovementioned processes of selecting M representative vectors a_(i)(f), generating matrix A′(f,m), calculating the separation matrix W(f,m), calculating the separated signal vectors Y(f,m), and transforming them into time-domain signal values y₁(t), . . . , y_(N)(t) are performed separately in each discrete time interval m. In this way, it is possible to ascertain all the separated signal components.

Advantages of this Embodiment Blind Source Separation with N>M

As described above, with this embodiment it is possible to achieve blind source separation even when there is a small number of sensors (N>M) as long as the source signals exhibit some degree of sparsity. As a result, it allows the number of sensors to be reduced and can contribute to reducing the device costs.

Effects of Normalization

The graphs in FIG. 18-FIG. 23 show some examples of the effects of performing normalization in normalization unit 512 aa. These show the observed signal vectors X(f,m) obtained at 2773 Hz when observing 1 or 2 speech sources with 2 microphones in a room with a reverberation time of 130 ms. Although these signals were observed with two microphones, they are plotted in four-dimensional space because the observed signal vectors X(f,m) are complex vectors in the frequency domain. Consequently, in FIG. 4-FIG. 9, these four dimensions are shown projected into a two-dimensional space. In these figures, “image” indicates the imaginary terms of each observed signal, and “Real” indicates the real terms. Also, X₁ indicates data relating to the observed signal observed by the first microphone, and X₂ indicates data relating to the observed signal observed by the second microphone.

First, FIG. 18-FIG. 20 show the effects of normalization in the case of a single audio source.

FIG. 18 shows a plot of the observed signal vectors X(f,m) before normalization. In this example, the vectors form a cluster around the origin, and it is not possible to obtain useful information from this cluster about representative vector a₁(f) relating to source signal 1. On the other hand, FIG. 19 shows a plot of the observed signal vectors X(f,m) after normalization by Formula (36). In this example, the samples are distributed in a specific direction from the origin. This direction corresponds to the representative vector a₁(f) to be estimated. This provides useful information for determining the representative vector a_(i)(f). Also, FIG. 20 shows a plot of the observed signal vectors X(f,m) after normalization by Formula (37). In this example, the vectors form a cluster at a location that is separate from the origin. The vector joining the center of this cluster to the origin corresponds to the representative vector a₁(f) to be estimated.

Next, FIG. 21-FIG. 23 show the effects of normalization in the case of two audio sources.

FIG. 21 shows a plot of the observed signal vectors X(f,m) before normalization. As in the case of a single audio source, it is not possible to obtain useful information about the two audio sources in this case. FIG. 22 shows a plot of the observed signal vectors X(f,m) after normalization by Formula (36). In this example, the samples are distributed in two directions from the origin. These directions correspond to the representative vectors a₁(f) and a₂(f) to be estimated. FIG. 23 shows a plot of the observed signal vectors X(f,m) after normalization by Formula (37). In this example, the vectors form two clusters at locations that are separate from the origin. The vectors joining the centers of these clusters to the origin correspond to the representative vectors a₁(f) and a₂(f) to be estimated.

Effects of Generating a Separation Matrix Using an Approximate Solution

As mentioned above, when minimization is strictly performed in the generation of a separation matrix W(f,m) in cases where N>M, the computational load becomes very heavy. For example, since there are NCM ways of making M selections from N representative vectors a₁(f), . . . , a_(N)(f), it would take a computational cost proportional to _(N)C_(M) in order to strictly find the combination that minimizes the L₁ norm (Formula (46)). However, with the approximate solution shown in FIG. 17, it is possible to make do with a lower computational load because the number of loop iterations only needs to correspond to the number of sensors M.

In this embodiment, it is assumed that different procedures are used to generate the separation matrix W(f,m) depending on whether or not there is a sufficient number of sensors with respect to the number of signal sources (i.e., whether or not N≦M). However, it is also possible to use the same routine to generate the separation matrix W(f,m) regardless of whether or not there is a sufficient number of sensors with respect to the number of signal sources.

FIG. 24 shows a flowchart illustrating this example.

In this variant, regardless of whether or not N≦M, column selection unit 516 first reads in estimated mixing matrix A(f) and observed signal vector X(f,m) from temporary memory unit 522 (Step S81), initializes residual vector e with the observed signal vector X(f,m), and assigns a value of 1 to variable k (Step S82). Column selection unit 516 then judges whether or not k≦min(M,N) (Step S83), and if so it selects the column a_(q(u))(f) that maximizes the expression |a_(q(u))(f)^(H)·e|/∥a_(q(u))(f)∥ (where α^(H) is the conjugate transposition matrix of α) (Step S84), sets up a matrix Q=[a_(q(1))(f), . . . , a_(q(k))(f)] representing the subspace spanned by all the selected columns a_(q(u))(u=1, . . . , k) (Step S85), calculates p=Q(Q^(H)Q)⁻¹Q^(H) (Step S86), updates the residual vector e according to the result of calculating X(f,m)−P·X(f,m) (Step S87), updates the value of variable k by adding 1 to it (Step S88), and returns to Step S83. In other words, the processing of Steps S83-88 is repeated min(M,N) times. Here, min(M,N) denotes the smaller of the two values M and N, and max(N−M,0) denotes the value of N−M or zero, whichever is the larger.

Next, matrix generation unit 517 reads in these min(M,N) representative vectors a_(q(i)) from temporary memory unit 522, generates the column vectors a_(i)′(f,m) as follows (Step S89):

$\quad\begin{matrix} {{FORMULA}\mspace{14mu} 50} & \; \\ {{a_{i}^{\prime}\left( {f,m} \right)} = \left\{ \begin{matrix} {a(f)} & {i \in \left\{ {{q(1)},\ldots\mspace{11mu},{q\left( {\min\left( {M,N} \right)} \right)}} \right\}} \\ 0 & {i \notin \left\{ {{q(1)},\ldots\mspace{11mu},{q\left( {\min\left( {M,N} \right)} \right)}} \right\}} \end{matrix} \right.} & (50) \end{matrix}$ and generates the matrix A′(f,m)=[a₁′(f,m), . . . , a_(N)′(f,m)] whose columns consist of min(M,N) representative vectors a_(i)(f) and max(N−M,0) zero vectors (Step S90). After the resulting matrix A′(f,m) has been stored in temporary memory unit 522, it is read in by separation matrix generation unit 518, which calculates separation matrix W(f,m) as the Moore-Penrose pseudo-inverse matrix A(f,m)⁺ thereof (equivalent to the inverse matrix A′(f,m)⁻¹ when M=N) (Step S91). This is equivalent to an N-row×M-column separation matrix W(f,m) which is the Moore-Penrose pseudo-inverse matrix of an M-row×N-column matrix where 0 or more of the N representative vectors a_(i)(f) have been substituted with zero vectors.

Variants, Etc.

The present invention is not limited to the embodiments mentioned above. For example, in the first through eighth embodiments, the extracted signals are combined after they have been returned to the time domain, but it is also possible to transform the signals into the time domain after they have been combined in the frequency domain.

FIG. 25 shows a partial block diagram illustrating a configuration in which the signals area transformed into the time domain after they have been combined in the frequency domain. The configuration shown in this figure is a configuration that can be provided instead of limited signal separation unit 60-k, time domain transformation unit 70-k and signal combination unit 80 in FIG. 1.

In this example, the frequency-domain signal values Y_(kq) ^(Πkq)(f,m) output of the limited signal separation units 601-k from all systems K are combined in the frequency domain by signal combination unit 602, and are then transformed into the time domain by time domain transformation unit 603. When there is only one separated signal Y_(kq) ^(Πkq)(f,m) having the same tag as at a certain frequency f, signal combination unit 602 obtains the separated signal value from the following formula: Y _(i)(f,m)=Y _(kq) ^(Πkq)(f,m) Also, when there are two or more separated signals Y_(kq) ^(Πkq)(f,m) having the same tag a_(i) at a certain frequency f, Y_(i)(f,m) is obtained as, for example, the mean of the separated signals Y_(kq) ^(Πkq)(f,m) having the same tag a_(i) as follows:

FORMULA  51 ${{Y_{i}\left( {f,m} \right)} = {\frac{1}{K}{\sum\limits_{\Pi_{{kq} = a_{i}}\;}{Y_{kq}^{\Pi_{kq}}\left( {f,m} \right)}}}}\;$ (where K is the number of separated signals having the same tag a_(i))

Finally, time domain transformation unit 603 performs a short time inverse Fourier transform or the like to transform into the time domain y_(i)(t) the output signal values Y_(i)(f,m) that have been combined in the frequency domain.

Also, in the first through eighth embodiments, the signal combination process was performed by applying a tag to each separated signal, but instead of applying a tag to each separated signal, the output signals could be combined by using temporary memory unit 90 to store the set G_(k) of V representative values corresponding to the signals separated in each system k.

For example, when G_(k) does not include the same representative values in a plurality of systems, all the separated signals Y_(kq)(t) could be output as the final separated signals y_(i)(t) (i=1, . . . , N). Alternatively, all the separated signals Y_(kq)(f,m) in the frequency domain could be taken as the final separated signals Y_(i)(f,m) (i=1, . . . , N) in the frequency domain and then transformed into time-domain signals.

Also, when G_(k) includes K of the same representative values (where K≧2) in a plurality of systems, the signal correlations are calculated for all combinations of the separated signals of system k y_(kq)(t) (q=1, . . . , V_(k); where V_(k) is the number of elements in G_(k)) with the separated signals of system k′ y_(k′R)(t) (R=1, . . . , V_(k′)), and the mean of y_(kq)(t) and y_(k′R)(t) is obtained for K elements with where there is a high correlation. This is repeated for a plurality of systems that include the same representative value, thereby combining the signals. Alternatively, by performing the same operations on all the separated signals in the frequency domain, the signals could be combined in the frequency domain and then transformed into the time domain,

Furthermore, signal separation could be performed by a system that combines elements of the abovementioned first through ninth embodiments.

For example, the representative vectors could be obtained by the method of the eighth embodiment, and then the limited signals could be separated by the method of the second embodiment. For example, using the representative vectors obtained by representative value calculation unit 430 (FIG. 13), Formula (18) of the second embodiment could be replaced by obtaining M_(k)(f,m) and M_(DC)(f,m) as follows:

FORMULA  52 $\mspace{20mu}{{M_{k}\left( {f,m} \right)} = \left\{ {{\begin{matrix} 1 & {{D\left( {{X\left( {f,m} \right)},{a_{k}(f)}} \right)} < {\min_{k \neq j}{D\left( {{X\left( {f,m} \right)},{a_{j}(f)}} \right)}}} \\ 0 & {otherwise} \end{matrix}{M_{DC}\left( {f,m} \right)}} = \left\{ \begin{matrix} 1 & {{\max_{{a_{p}{(f)}} \in G_{k}}{D\left( {{X\left( {f,m} \right)},{a_{p}(f)}} \right)}} < {\min_{{a_{q}{(f)}} \in G_{k}^{c}}{D\left( {{X\left( {f,m} \right)},{a_{q}(f)}} \right)}}} \\ 0 & {otherwise} \end{matrix} \right.} \right.}$ (See FIG. 8 for an illustration of M_(k)(f,m) and M_(DC)(f,m)), and then the limited signals could be separated by the same procedure as limited signal separation unit 160-k in the second embodiment.

Here, instead of obtaining the abovementioned M_(k)(f,m) and M_(DC)(f,m), it is also possible to determine {circumflex over (X)}_(k)(f,m)=M_(k)X directly as follows:

FORMULA  53 ${{\hat{X}}_{k}\left( {f,m} \right)} = \left\{ \begin{matrix} {X\left( {f,m} \right)} & {{D\left( {{X\left( {f,m} \right)},{a_{k}(f)}} \right)} < {\min_{k \neq j}{D\left( {{X\left( {f,m} \right)},{a_{j}(f)}} \right)}}} \\ 0 & {otherwise} \end{matrix} \right.$ (corresponding to the processing performed by mask generation unit 151-k and multiplication arithmetic unit 161-k in FIG. 8), and to generate the limited signal values as follows:

${{\hat{X}}_{k}\left( {f,m} \right)} = \left\{ \begin{matrix} {X\left( {f,m} \right)} & {{\max_{{a_{p}{(f)}} \in G_{k}}{D\left( {{X\left( {f,m} \right)},{a_{p}(f)}} \right)}} < {\min_{{a_{q}{(f)}} \in G_{k}^{c}}{D\left( {{X\left( {f,m} \right)},{a_{q}(f)}} \right)}}} \\ 0 & {otherwise} \end{matrix} \right.$ (corresponding to the processing performed by mask generation unit 151-k and limited signal extraction unit 152-k in FIG. 8).

Alternatively, instead of generating M_(k)(f,m) in mask generation unit 151-k (FIG. 8), the representative vectors [a₁, . . . , a_(N)] (where a₁ is a column vector) obtained by representative value calculation unit 430 (FIG. 13) could be gathered together as H^ in mixing process estimation unit 162-k (FIG. 8) and used as an estimated mixing matrix.

Also, instead of the Fourier transforms and inverse Fourier transforms used to transform between the time domain and frequency domain in the above embodiments, other forms of transformation can be used such as wavelet transformation, DFT filter banks, or polyphase filter banks (see, e.g., R. E. Crochiere and L. R. Rabiner: “Multirate Digital Signal Processing,” Eaglewood Cliffs, N.J.: Prentice-Hall, 1983 (ISBN 0-13-605162-6)).

Computer implementations of the abovementioned first through ninth embodiments can be configured as described below.

FIG. 26 shows an example of a signal separation device 610 in which each embodiment is configured on a computer.

The signal separation device 610 of this example includes a CPU (central processing unit) 620, RAM (random access memory) 630, ROM (read only memory) 640, an external memory device 650, an input unit 660, an interface 670, and a bus 680.

CPU 620 is a central processing unit such as a RISC (reduced instruction set computer) or CISC (complex instruction set computer) chip incorporating an arithmetic logical unit 621, a control unit 622, and a register 623. Register 623 is a fast memory such as DRAM (dynamic random access memory) or SRAM (static random access memory), for example.

Also, RAM 630 is a rewritable semiconductor memory such as a DRAM, SRAM, flash memory, or NV (nonvolatile) RAM. ROM 640 is a read-only semiconductor memory such as an MROM (mask read-only memory), for example, and is used to store various programs, data and the like.

External memory device 650 is, for example, a hard disk device, a magnetic recording device such as a flexible disk or magnetic tape device, an optical disk device such as a DVD-RAM (random access memory) or CD-R (recordable)/RW (rewritable) device, a magneto-optical recording device such as an MO (magneto-optical) disc device, or a semiconductor memory such as an EEPROM (electronically erasable programmable read-only memory) or flash memory.

Input unit 660 is an input device such as a keyboard, mouse, joystick or the like. Interface 670 is, for example, an input/output port that is used for the input and/or output of data, and can be connected to various types of device such as sensors, communication boards, and memory devices.

The processing algorithm performed by signal separation device 610 is, for example, declared in the form of a signal separation program which is, for example, recorded on a recording medium that can be read by the computer. Examples of recording media that can be read by computer include any kind of magnetic recording device, optical disk, magneto-optical recording medium, semiconductor memory or the like; specifically, it is possible to use a magnetic recording device such as a hard disk device, a flexible disk device or a magnetic tape device, an optical disk such as a DVD (digital versatile disc), DVD-RAM (random access memory), CD-ROM (compact disc read only memory) or CD-R (recordable)/RW (rewritable), a magneto-optical recording medium such as an MO (magneto-optical disc), or a semiconductor memory such as an EEPROM (electronically erasable programmable read-only memory).

The signal separation program can be circulated by such means as selling, transferring, or lending a portable recording medium such as a DVD or CD-ROM on which this program is recorded, for example. Alternatively, a configuration could be employed whereby this program is stored in the memory device of a server computer and circulated by transmitting the program across a network from the server computer to another computer.

When processing is performed in signal separation device 610, it first downloads into the program region 651 of external memory device 650 a signal separation program recorded on a portable recorded medium or a signal separation program transmitted from a server computer, for example.

Also, the time-domain observed signals x_(j)(t) (j=1, . . . , M) observed by each sensor are pre-stored in data region 652 of external memory device 650. The storage of these observed signals x_(j)(t) may be achieved by inputting the observed signals x_(j)(t) sent from the sensors into interface 670 and storing them in external memory device 650 via bus 680, or by employing a configuration where the observed signals x_(j)(t) are pre-stored in external memory device 650 by a separate device, and this external memory device 650 is then connected to bus 680.

Next, for example, under the control of control unit 622 of CPU 620, the signal separation program is sequentially read in from the program region 651 of external memory device 650, and is stored in the program region 631 of RAM 630. The signal separation program stored in RAM 630 is read into CPU 620, and the control unit 622 of CPU 620 performs various processes according to the contents of this signal separation program, such as inputting and outputting data, performing computations in arithmetic logical unit 621, and storing data in register 623.

When the processing by CPU 620 is started, CPU 620 reads out the observed signals x_(j)(t) from data region 652 of external memory device 650, for example, and writes them to data region 632 of RAM 630, for example. CPU 620 then performs each of the abovementioned processes under the control of control unit 622 while sequentially reading out the signal separation program from the program region 631 of RAM 630 and the observed signals x_(j)(t) from data region 632. Here, for example, RAM 630 or external memory device 650 performs the functions of memory unit 2 or 501 in the first through ninth embodiments, and RAM 630 or register 623 performs the functions of temporary memory unit 90 or 522 in the first through ninth embodiments.

Also, as another embodiment of this program, CPU 620 could read the program directly from a portable recording medium and execute the processing according to this program, or CPU 620 could sequentially execute processing according to programs transmitted to it from a server computer. It is also possible to employ a configuration where when abovementioned processing is performed by a so-called ASP (application service provider), whereby, instead of transmitting programs from a server computer to this computer, the processing functions are implemented just by issuing instructions and gathering results.

Furthermore, in addition to performing the above processes in the temporal sequence described above, they may also be performed in parallel or individually according to requirements or to increase the performance of the device that executes the processing. And, needless to say, it is possible to make other suitable modifications without departing from the essence of the present invention.

POTENTIAL INDUSTRIAL USES

With this invention, it is possible to separate and extract target signals even, for example, in environments where various types of noise and interference signals are present. For example, when applied to the field of audio engineering, it could be used to construct a speech recognition system that achieves a high recognition rate by separating and extracting the target speech even in situations where the input microphones of the speech recognition equipment are some distance away from the speaker and pick up sounds other than the speech produced by the target speaker. 

1. A signal separation method that separates and extracts signals under conditions where N (N≧2) signals are mixed together and observed with M sensors, comprising: a procedure that transforms the observed signal values observed by said sensors into frequency-domain signal values, a procedure that uses said frequency-domain signal values to calculate at each frequency the relative values of the observed values between said sensors (including mapping these relative values), a procedure that clusters said relative values into N clusters, a procedure that calculates a representative value for each of said clusters, a procedure that uses said representative values to generate a mask for the purpose of extracting, from said frequency-domain signal values, mixed signal values comprising the signals emitted from V (2≦V≦M) signal sources, a procedure that uses said mask to extract said mixed signal values from said frequency-domain signal values, and a procedure that separates and extracts the values of V signals from said mixed signal values.
 2. A signal separation method according to claim 1, wherein said mask is a function that takes a high level value for said relative values that are within a prescribed range that includes V said representative values, and takes a low level value for said representative values that are not inside said prescribed range, and wherein the procedure that uses said mask to extract said mixed signal values from said frequency-domain signal values is a procedure in which said frequency-domain signal values are multiplied by said mask.
 3. A signal separation method according to claim 1, wherein said mask is a function that takes a low level value for said relative values that are within a prescribed range that includes V said representative values, and takes a high level value for said representative values that are not inside said prescribed range, and wherein the procedure that uses said mask to extract said mixed signal values from said frequency-domain signal values is a procedure in which the values obtained by multiplying said frequency-domain signal values by said mask are subtracted from said frequency-domain signal values.
 4. A signal separation method according to claim 2, wherein said mask is a function that the transitions from said high level value to said low level value that accompany changes of said relative value occur in a continuous fashion.
 5. A signal separation method according to claim 1, wherein the procedure that uses said representative values to generate a mask for the purpose of extracting, from said frequency-domain signal values, mixed signal values comprising the signals emitted from V (2≦V≦M) signal sources is a procedure whereby said mask is generated by using the directional characteristics of a null beamformer (NBF).
 6. A signal separation method according to claim 1, wherein the procedure that uses said representative values to generate a mask for the purpose of extracting, from said frequency-domain signal values, mixed signal values comprising the signals emitted from V (2≦V≦M) signal sources includes: a procedure that generates an (N−V+1)×(N−V+1) delay matrix H_(NBF)(f) in which the element at (j,i) is equal to exp(j2πfτ_(ji)), where τ_(ji)(d_(j)/v_(e))cos θ_(i), v_(e) is the velocity of the signals, d_(j) is the distance between sensor 1 and sensor j (j=1, . . . , N−V+1), θ₁ is any one of the estimated directions of the signal sources corresponding to the V said representative values, θ_(i)(i=2, . . . , N−V+1) are the estimated directions of the signal sources corresponding to the other said representative values of the V said representative values, and f is a frequency variable, a procedure that calculates the inverse matrix W(f)=H_(NBF) ⁻¹(f) of delay matrix H_(NBF)(f) as a NBF matrix W(f), a procedure that generates a directional characteristics function $\;{{F\left( {f,\theta} \right)} = {\sum\limits_{k = 1}^{N - V + 1}\;{{W_{1k}(f)}{\exp\left( {{j2\pi}\;{fd}_{k}\cos\;{\theta/v_{e}}} \right)}}}}$ where θ is a signal arrival direction variable, and the first row element of said NBF matrix W(f) is W_(1k)(f), and a procedure that uses said directional characteristics function F(f,θ) to generate said mask.
 7. A signal separation method according to claim 1, wherein the procedure that uses said representative values to generate a mask for the purpose of extracting, from said frequency-domain signal values, mixed signal values comprising the signals emitted from V (2≦V≦M) signal sources includes: a procedure that generates a function consisting of a single-peak function convolved with a binary mask, which is a function that takes a high level value for said relative values that are within a prescribed range including V said representative values and takes a low level value for said representative values that are not inside said prescribed range and where changes of the relative value are accompanied by discontinues transitions from said high level value to said low level value, and a procedure that generates said mask as a function in which said relative values are substituted into said function consisting of a single-peak function convolved with a binary mask.
 8. A signal separation method according to claim 1, wherein the procedure that uses said representative values to generate a mask for the purpose of extracting, from said frequency-domain signal values, mixed signal values comprising the signals emitted from V (2<=V<=M) signal sources is a procedure that generates said mask as a single-peak function obtained by mapping the differences between a first odd function that takes a value of zero when said relative value is the lower limit value a_(min) in a prescribed range including V said representative values and a second odd function that takes a value of zero when said representative value is the upper limit value a_(max) in said prescribed range.
 9. A signal separation method according to one of claims 2 or 3, wherein said mask is a function that transitions from said high level value to said low level value occur in a discontinues fashion.
 10. A signal separation method that separates and extracts signals under conditions where N (N≧2) signals are mixed together and observed with M sensors, comprising: a procedure that transforms the observed signal values observed by said sensors into frequency-domain signal values, a procedure that uses said frequency-domain signal values to calculate at each frequency the relative values of the observed values between said sensors (including mapping these relative values), a procedure that clusters said relative values into N clusters, a procedure that calculates a representative value for each of said clusters, a procedure that generates a mask function that takes a high level value for said relative values that are within a prescribed range that includes one of the said representative values, and takes a low level value for said representative values that are not inside said prescribed range, wherein the transitions from said high level value to said low level value that accompany changes of said relative value occur in a continuous fashion, and a procedure that multiplies said frequency-domain signal values by said mask to extract the signal emitted from one signal source.
 11. A signal separation method that separates and extracts signals under conditions where N (N≧2) signals are mixed together and observed with M sensors, comprising: a procedure that transforms the observed signal values x₁(t), . . . , x_(M)(t) observed by said sensors into frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m), a procedure that clusters first vectors X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)] comprising said frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m) into N clusters C_(i)(f) (i1, . . . , N) at each frequency f, a procedure that calculates second vectors a_(i)(f) to represent each said cluster C_(i)(f), a procedure that extracts V (1≦V≦M) third vectors a_(p)(f) (p=1, . . . , V) from said second vectors a_(i)(f), a procedure that generates a mask M(f,m) represented by the formula ${M\left( {f,m} \right)} = \left\{ \begin{matrix} 1 & {{\max_{{a_{p}{(f)}} \in G_{k}}{D\left( {{X\left( {f,m} \right)},{a_{p}(f)}} \right)}} < {\min_{{a_{q}{(f)}} \in G_{k}^{c}}{D\left( {{X\left( {f,m} \right)},{a_{q}(f)}} \right)}}} \\ 0 & {otherwise} \end{matrix} \right.$ where G_(k) is the set of said third vectors a_(p)(f), G_(k) ^(c) is the complementary set of G_(k), and D(α,β) is the Mahanalobis square distance between the vectors α and β, and a procedure that extracts the signal values emitted from V of said signal sources by calculating the product of said mask M(f,m) and said first vectors X(f,m).
 12. A signal separation method that separates and extracts signals under conditions where N (N≧2) signals are mixed together and observed with M sensors, wherein a procedure that transforms the observed signal values x₁(t), . . . , x_(M)(t) observed by said sensors into frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m), a procedure that clusters first vectors X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)] comprising said frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m) into N clusters C_(i)(f) (i=1, . . . , N) at each frequency f, a procedure that calculates second vectors a_(i)(f) to represent each said cluster C₁(f), a procedure that extracts V (1≦V≦M) third vectors a_(p)(f) (p=1, . . . , V) from said second vectors a_(i)(f), and a procedure that judges whether or not said first vectors X(f,m) satisfy the relationship max_(a) _(p) _((f)∈G) _(k) D(X(f,m)a _(p)(f))<min_(a) _(q) _((f)∈G) _(k) _(c) D(X(f,m),a _(q)(f))  Formula 56 where G_(k) is the set of said third vectors a_(p)(f), G_(k) ^(c) is the complementary set of G_(k), and D(α, β) is the Mahanalobis square distance between the vectors αand β, and, if so, extracts said first vectors X(f,m) as the signal values emitted from V of the said signal sources.
 13. A signal separation method according to one of claims 11 or 12, wherein said clustering procedure is performed after performing the calculation $\left. {{sign}\left( {X_{j}\left( {f,m} \right)} \right)}\leftarrow\left\{ {\begin{matrix} {{X_{j}\left( {f,m} \right)}/{{X_{j}\left( {f,m} \right)}}} & \left( {{{X_{j}\left( {f,m} \right)}} \neq 0} \right) \\ 0 & \left( {{{X_{j}\left( {f,m} \right)}} = 0} \right) \end{matrix}\;{and}{X\left( {f,m} \right)}}\leftarrow\left\{ {\begin{matrix} {{X\left( {f,m} \right)}/{{sign}\left( {X_{j}\left( {f,m} \right)} \right)}} & \left( {{{X_{j}\left( {f,m} \right)}} \neq 0} \right) \\ {X\left( {f,m} \right)} & \left( {{{X_{j}\left( {f,m} \right)}} = 0} \right) \end{matrix}.} \right. \right. \right.$
 14. A signal separation method according to claim 13, wherein said clustering procedure is performed after performing the calculation $\left. {X\left( {f,m} \right)}\leftarrow\left\{ \begin{matrix} {{X\left( {f,m} \right)}/{{X\left( {f,m} \right)}}} & \left( {{{X\left( {f,m} \right)}} \neq 0} \right) \\ {X\left( {f,m} \right)} & \left( {{{X\left( {f,m} \right)}} = 0} \right) \end{matrix} \right. \right.$ (where the notation ∥X(f,m)∥ denotes the norm of X(f,m)). After said formula $\left. {X\left( {f,m} \right)}\leftarrow\left\{ {\begin{matrix} {{X\left( {f,m} \right)}/{{sign}\left( {X_{j}\left( {f,m} \right)} \right)}} & \left( {{{X_{j}\left( {f,m} \right)}} \neq 0} \right) \\ {X\left( {f,m} \right)} & \left( {{{X_{j}\left( {f,m} \right)}} = 0} \right) \end{matrix}.} \right. \right.$
 15. A signal separation method that separates and extracts signals under conditions where N (N≧2) signals are mixed together and observed with M sensors, comprising a procedure that transforms the observed signal values x₁(t), . . . , x_(M)(t) observed by said sensors into frequency-domain signal values X₁(f,m), . . . , X_(M)(F,m), a procedure that clusters first vectors X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)]^(T) comprising said frequency-domain signal values X1(f,m), . . . , X_(M)(gm) into N clusters C_(i)(f) (i=1, . . . , N) at each frequency f, a procedure that calculates second vectors a_(i)(f) to represent each said cluster C_(i)(f), a procedure that calculates an N-row×M-column separation matrix W(f,m) that is the Moore-Penrose pseudo-inverse matrix of an M-row×N-column matrix in which 0 or more of the N said second vectors a_(i)(f) are substituted with zero vectors, and a procedure that calculates a separated signal vector Y(f,m)=[Y₁(f,m), . . . , Y_(N)(f,m)]^(T) by performing the calculation Y(f,m)=W(f,m)X(f,m).
 16. A signal separation method according to claim 15, wherein: the procedure that calculates said separation matrix W(f,m) is a procedure that selects min(M,N) said second vectors a_(i)(f), generates a matrix A′(f,m) whose columns are the selected min(M,N) said second vectors a_(i)(f) and max(N−M,0) zero vectors, and calculates said separation matrix W(f,m) as the Moore-Penrose pseudo-inverse matrix of said matrix A′(f,m).
 17. A signal separation method according to claim 15, wherein: the procedure used to calculate said separation matrix W(f,m) when N>M is a procedure that selects M said second vectors a_(i)(f) in each discrete time interval m, generates a matrix A′(f,m) whose columns are the selected M said second vectors a_(i)(f) and N−M zero vectors, and calculates said (time-dependent) separation matrix W(f,m) as the Moore-Penrose pseudo-inverse matrix of said matrix A′(f,m), and the procedure used to calculate said separation matrix W(f,m) when N≦M is a procedure that calculates the Moore-Penrose pseudo-inverse matrix of a matrix comprising N said second vectors in each said cluster C_(i)(f) to yield said (time-invariant) separation matrix W(f,m).
 18. A signal separation method according to claim 15, wherein: said clustering procedure is performed after performing the calculation $\left. {{sign}\left( {X_{j}\left( {f,m} \right)} \right)}\leftarrow\left\{ {\begin{matrix} {{X_{j}\left( {f,m} \right)}/{{X_{j}\left( {f,m} \right)}}} & \left( {{{X_{j}\left( {f,m} \right)}} \neq 0} \right) \\ 0 & \left( {{{X_{j}\left( {f,m} \right)}} = 0} \right) \end{matrix}{and}X\left( {f,m} \right)}\leftarrow\left\{ {\begin{matrix} {{X\left( {f,m} \right)}/{{sign}\left( {X_{j}\left( {f,m} \right)} \right)}} & \left( {{{X_{j}\left( {f,m} \right)}} \neq 0} \right) \\ {X\left( {f,m} \right)} & \left( {{{X_{j}\left( {f,m} \right)}} = 0} \right) \end{matrix}.} \right. \right. \right.$
 19. A signal separation method according to claim 18, wherein: said clustering procedure is performed after performing the calculation $\left. {X\left( {f,m} \right)}\leftarrow\left\{ \begin{matrix} {{X\left( {f,m} \right)}/{{X\left( {f,m} \right)}}} & \left( {{{X\left( {f,m} \right)}} \neq 0} \right) \\ {X\left( {f,m} \right)} & \left( {{{X\left( {f,m} \right)}} = 0} \right) \end{matrix} \right. \right.$ (where the notation X(f,m) denotes the norm of X(f,m)) in addition to said formula $\left. {X\left( {f,m} \right)}\leftarrow\left\{ {\begin{matrix} {{X\left( {f,m} \right)}/{{sign}\left( {X_{j}\left( {f,m} \right)} \right)}} & \left( {{{X_{j}\left( {f,m} \right)}} \neq 0} \right) \\ {X\left( {f,m} \right)} & \left( {{{X_{j}\left( {f,m} \right)}} = 0} \right) \end{matrix}.} \right. \right.$
 20. A signal separation method according to claim 16, wherein said procedure that selects min(M,N) said second vectors a_(i)(f) comprises a procedure that initializes fourth vectors e with said first vectors X(f,m), and a procedure that repeats a process min(M,N) times wherein said process comprises steps for selecting said second vectors a_(q(u))(f) that maximize the absolute value of the dot product of a_(q(u))(f)/∥a_(q(u))(f)∥ and said fourth vectors, sets setting up a matrix Q=[a_(q(1))(f), . . . , a_(q(k))(f)] representing the subspace subtended by all said second vectors a_(q(u))(u=1, . . . , k) selected so far, performing the calculation P=Q(Q^(H)Q)⁻¹Q_(H), and updating the fourth vectors e with e=X(f,m)−P·X(f,m).
 21. A signal separation device that separates and extracts signals under conditions where N (N≧2) signals are mixed together and observed with M sensors, comprising: a memory unit that stores the observed signal values observed by said sensors; and a processor which is connected to said memory unit and is configured to transform said observed signal values into frequency-domain signal values, to use said frequency-domain signal values to calculate at each frequency the relative values of the observed values between said sensors (including mapping these relative values), to cluster said relative values into N clusters, to calculate a representative value for each of said clusters, to use said representative values to generate a mask for the purpose of extracting, from said frequency-domain signal values, mixed signal values comprising the signals emitted from V (2≦V≦M) signal sources, to use said mask to extract said mixed signal values from said frequency-domain signal values, and to separate and extract the values of V signals from said mixed signal values.
 22. A signal separation device that separates and extracts signals under conditions where N (N≧2) signals are mixed together and observed with M sensors, comprising: a memory unit that stores the observed signal values observed by said sensors; and a processor which is connected to said memory unit and is configured to transform said observed signal values into frequency-domain signal values, to use said frequency-domain signal values to calculate at each frequency the relative values of the observed values between said sensors (including mapping these relative values), to cluster said relative values into N clusters to calculate a representative value for each of said clusters, to generate a mask, which is a function that takes a high level value for said relative values that are within a prescribed range that includes one said representative value, and takes a low level value for said representative values that are not inside said prescribed range, and where the transitions from said high level value to said low level value that accompany changes of said relative value occur in a continuous fashion, and to extract the values of a signal emitted from one signal source by multiplying said frequency-domain values by said mask.
 23. A signal separation device that separates and extracts signals under conditions where N (N≧2) signals are mixed together and observed with M sensors, comprising: a memory unit that stores the observed signal values x₁(t), . . . , x_(M)(t) observed by said sensors; and a processor which is connected to said memory unit and is configured to transform said observed signal values x₁(t), . . . , x_(M)(t) into frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m), to cluster first vectors X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)] comprising said frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m) into N clusters C_(i)(f) (i=1, . . . , N) at each frequency f, to calculate second vectors a_(i)(f) to represent each said cluster C_(i)(f), and extracts V (1≦V≦M) third vectors a_(p)(f) (p=1, . . . , V) from said second vectors a_(i)(f), to generate a mask M(f,m) represented by the formula ${M\left( {f,m} \right)} = \left\{ \begin{matrix} 1 & {{\max_{{a_{p}{(f)}} \in G_{k}}{D\left( {{X\left( {f,m} \right)},{a_{p}(f)}} \right)}} < {\min_{{a_{q}{(f)}} \in G_{k}^{c}}{D\left( {{X\left( {f,m} \right)},{a_{q}(f)}} \right)}}} \\ 0 & {otherwise} \end{matrix} \right.$ where G_(k) is the set of said third vectors a_(p)(f), G_(k) ^(c) is the complementary set of G_(k), and D(αβ) is the Mahanalobis square distance between the vectors α and β, and to extract the signal values emitted from V of the said signal sources by calculating the product of said mask M(f,m) and said first vectors X(f,m).
 24. A signal separation device that separates and extracts signals under conditions where N (N≧2) signals are mixed together and observed with M sensors, comprising: a memory unit that stores the observed signal values x₁(t), . . . , x_(M)(t) observed by said sensors; and a processor which is connected to said memory unit and is configured to transform said observed signal values x₁(t), . . . , x_(M)(t) into frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m), to cluster first vectors X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)] comprising said frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m) into N clusters C_(i)(f) (i=1, . . . , N) at each frequency f, to calculate second vectors a_(i)(f) to represent each said cluster C_(i)(f), to extract V (1≧V≧M) third vectors a_(p)(f) (p=1, . . . , V) from said second vectors a_(i)(f), to judge whether or not said first vectors satisfy the relationship max_(a) _(p) _((f)∈G) _(k) D(X(f,m),a _(p)(f))<min_(a) _(q) _((f)∈G) _(k) _(g) D(X(f,m),a _(q)(f))  Formula 62 where G_(k) is the set of said third vectors a_(p)(f), G_(k) ^(c) is the complementary set of G_(k), and D(α,β) is the Mahanalobis square distance between the vectors αz and β, and to extract said first vectors X(f,m) satisfying said relationship as the signal values emitted from V of the said signal sources.
 25. A signal separation device that separates and extracts signals under conditions where N (N≧2) signals are mixed together and observed with M sensors, comprising: a memory unit that stores the observed signal values x₁(t), . . . , x_(M)(t) observed by said sensors; and a processor which is connected to said memory unit and is configured to transform said observed signal values X₁(t), . . . , X_(M)(t) into frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m), to cluster first vectors X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)]^(T) comprising said frequency-domain signal values X₁(f,m), . . , X_(M)(gm) into N clusters C_(i)(f) (i=1, . . , N) at each frequency f, to calculate second vectors a_(i)(f) to represent each said cluster C_(i)(f), to calculate an N-row×M-column separation matrix W(f,m) that is the Moore-Penrose pseudo-inverse matrix of an M-row×N-column matrix in which 0 or more of the N said second vectors a_(i)(f) are substituted with zero vectors, and to calculate a separated signal vector Y(f,m)=[Y₁(f,m), . . . , Y_(N)(f,m)]^(T) by performing the calculation Y(f,m)=W(f,m)X(f,m).
 26. A computer readable medium storing a signal separation program, which when executed by a computer causes the computer to perform: a procedure that transforms observed signal values, which are mixtures of N (N≧2) signals observed with M sensors, into frequency-domain values, a procedure that uses said frequency-domain signal values to calculate at each frequency the relative values of the observed values between said sensors (including mapping these relative values), a procedure that clusters said relative values into N clusters, a procedure that calculates a representative value for each of said clusters, a procedure that uses said representative values to generate a mask for the purpose of extracting, from said frequency-domain signal values, mixed signal values comprising the signals emitted from V (2≦V≦M) signal sources, a procedure that uses said mask to extract said mixed signal values from said frequency-domain signal values, and a procedure that separates and extracts the values of V signals from said mixed signal values.
 27. A computer readable medium storing a signal separation program, which when executed by a computer, causes the computer to perform: a procedure that transforms observed signal values, which are mixtures of N (N≧2) signals observed with M sensors, into frequency-domain values, a procedure that uses said frequency-domain signal values to calculate at each frequency the relative values of the observed values between said sensors (including mapping these relative values), a procedure that clusters said relative values into N clusters, a procedure that calculates a representative value for each of said clusters, a procedure that generates a mask, which is a function that takes a high level value for said relative values that are within a prescribed range that includes one of said representative values, and takes a low level value for said representative values that are not inside said prescribed range, wherein the transitions from said high level value to said low level value that accompany changes of said relative value occur in a continuous fashion, and a procedure that extracts the signal values emitted from one signal source by multiplying said frequency-domain signal values by said mask.
 28. A computer readable medium storing a signal separation program, which when executed by a computer, causes the computer to perform: a procedure that transforms observed signal values x_(i)(t), . . . , x_(M)(t), which are mixtures of N (N≧2) signals observed by M sensors, into frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m). a procedure that clusters first vectors X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)] comprising said frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m) into N clusters C_(i)(f) (i=1, . . . , N) at each frequency f, a procedure that calculates second vectors a_(i)(f) to represent each said cluster C_(i)(f), a procedure that extracts V (1≦V≦M) third vectors a_(p)(f) (p=1, . . . , V) from said second vectors a_(i)(f), a procedure that generates a mask M(f,m) represented by the formula ${M\left( {f,m} \right)} = \left\{ \begin{matrix} 1 & {{\max_{{a_{p}{(f)}} \in G_{k}}{D\left( {{X\left( {f,m} \right)},{a_{p}(f)}} \right)}} < {\min_{{a_{q}{(f)}} \in G_{k}^{c}}{D\left( {{X\left( {f,m} \right)},{a_{q}(f)}} \right)}}} \\ 0 & {otherwise} \end{matrix} \right.$ where G_(k) is the set of said third vectors a_(p)(f), G_(k) ^(c) is the complementary set of G_(k), and D(α,β) is the Mahanalobis square distance between the vectors α and β, and a procedure that extracts the signal values emitted from V of said signal sources by calculating the product of said mask M(f,m) and said first vectors X(f,m).
 29. A computer readable medium storing signal separation program, which when executed by a computer, causes the computer to perform: a procedure that transforms observed signal values x₁(t), . . . , x_(M)(t), which are mixtures of N (N≧2) signals observed by M sensors, into frequency-domain signal values X₁(f,m), . . , X_(M)(f,m), a procedure that clusters first vectors X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)] comprising said frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m) into N clusters C_(i)(f) (i=1, . . . , N) at each frequency f, a procedure that calculates second vectors a_(i)(f) to represent each said cluster C_(i)(f), a procedure that extracts V (1≦V≦M) third vectors a_(p)(f) (p=1, . . . , V) from said second vectors a_(i)(f), and a procedure that judges whether or not said first vectors X(f,m) satisfy the relationship max_(a) _(p) _((f)∈G) _(k) D(X(f,m),a _(p)(f))<min_(a) _(q) _((f)∈G) _(k) _(c) D(X(f,m),a _(q)(f))  Formula 64 where G_(k) is the set of said third vectors a_(p)(f), G_(k) ^(c) is the complementary set of G_(k), and D(α,β) is the Mahanalobis square distance between the vectors α and β, and, if so, extracts said first vectors X(f,m) as the signal values emitted from V of the said signal sources.
 30. A computer readable medium storing a signal separation program, which when executed by a computer, causes the computer to perform: a procedure that transforms observed signal values x₁(t), . . . , x_(M)(t), which are mixtures of N (N≧2) signals observed by M sensors, into frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m), a procedure that clusters first vectors X(f,m)=[X₁(f,m), . . . , X_(M)(f,m)]^(T) comprising said frequency-domain signal values X₁(f,m), . . . , X_(M)(f,m) into N clusters C^(i)(f) (i=1, . . . , N) at each frequency f, a procedure that calculates second vectors a_(i)(f) to represent each said cluster C_(i)(f), a procedure that calculates an N-row×M-column separation matrix W(f,m) that is the Moore-Penrose pseudo-inverse matrix of an M-row×N-column matrix in which 0 or more of the N said second vectors a_(i)(f) are substituted with zero vectors, and a procedure that calculates a separated signal vector Y(f,m)=[Y₁(f,m), . . , Y_(N)(f,m)]^(T) by performing the calculation Y(f,m)=W(f,m)X(f,m). 